Hi Gary, Do you not just want an algorithm to compute the convex hull of the points?
If so, the Graham Scan algorithm will probably do what you want, though there are others. See http://softsurfer.com/Archive/algorithm_0109/algorithm_0109.htm for an explanation. Cheers, David. > -----Original Message----- > From: [email protected] [mailto:talk- > [email protected]] On Behalf Of Gary G: > Sent: 06 April 2009 07:01 > To: [email protected]; [email protected] > Subject: [OSM-talk] Limiting Polygon? > > Hi, > is there anyone aware of an algorithm that produces a limiting polygon > around a heap of nodes - let's say around an osm file cut from a planet > file? > > Best would be PERL... > > Thanks > > Gerhard > gary68 > > > _______________________________________________ > talk mailing list > [email protected] > http://lists.openstreetmap.org/listinfo/talk _______________________________________________ talk mailing list [email protected] http://lists.openstreetmap.org/listinfo/talk
