Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I’m trying to take a dense graph of points such as this, and turn it into a graph of connected convex polygons. The polygons should be as large and as simple as possible while staying connected. The resultant graph will be used for pathfinding. Can anyone point me in the right direction?
It is very annoying that I can’t post links. Makes it hard to be a lurker & only occasional participator.
I ended up using the following techniques:
First, create a distance transform. I used the algorithm described here [can’t link], resulting in an image like this [can’t link]. Then, create a watershed transform of the DT to partition it into areas. This needs some work, but currently looks like this [can’t link] Then, use the midpoints of the polylines connecting each pair of areas, to create a waypoint graph.
Result
The watershed partitioning isn’t perfect yet, note the aliasing causing banding but I end up with 181 areas and 281 waypoints for this 128×128 map.