Re: A computational geometry problem
Ben Sunshine-Hill <[email protected]>
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
On Sat, Aug 22, 2009 at 8:17 AM, J.-R. Jiang <[email protected]>wrote: > Problem: Given n lines, determine a point minimizing the summation of the > distances from the point to the n lines. > This is a Least Absolute Deviations problem, which are normally solved by simplex methods; see the Wikipedia page for more details. If an O(n^3) running time is acceptable to you, however, a minimal solution will always be found at the intersection of two of the lines, so you can just check all the intersection points if you like. Ben ------------------------------------------------------------------------------ Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day trial. Simplify your report design, integration and deployment - and focus on what you do best, core application coding. Discover what's new with Crystal Reports now. http://p.sf.net/sfu/bobj-july _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list