Finding a polygon that encloses a set of points
-
Greetings, I'm trying to determine the best way to get a polygon from a set of points. The points are not in any particularly useful order (they are the endpoints of individual lines that fill the polygon in question). How can I easily take such a set of points and figure out the vertices of a polygon from them? The polygons may have gaps inside of them. Any ideas? Thanks, Will PS. Sorry about the repost from the Graphics forum. I wasn't sure whether to put it here or there, but was informed that here was a better choice.
-
Greetings, I'm trying to determine the best way to get a polygon from a set of points. The points are not in any particularly useful order (they are the endpoints of individual lines that fill the polygon in question). How can I easily take such a set of points and figure out the vertices of a polygon from them? The polygons may have gaps inside of them. Any ideas? Thanks, Will PS. Sorry about the repost from the Graphics forum. I wasn't sure whether to put it here or there, but was informed that here was a better choice.
-
Greetings, I'm trying to determine the best way to get a polygon from a set of points. The points are not in any particularly useful order (they are the endpoints of individual lines that fill the polygon in question). How can I easily take such a set of points and figure out the vertices of a polygon from them? The polygons may have gaps inside of them. Any ideas? Thanks, Will PS. Sorry about the repost from the Graphics forum. I wasn't sure whether to put it here or there, but was informed that here was a better choice.
This is a really dificult... perspective... if the shape is solid(with enclosed points) then you can use a contracting concentric circle approach. if you have a form of wrapping region... good luck(unless there is other structure to your data that you didn't include) I recently did something similar (the convex polygon approach to making a vooroni tesselation(delanuy triagulation)). you can alternativly use a line crossing approach, but this is also tricky. it is best if the points are "ordered" either inpriciple, or by allowence, and then building up the polygon vertex(pair) by vertex(pair).