• Advertisement
Sign in to follow this  

polygon tesselation

This topic is 4973 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Could you suggest simple algorithms that takes care of tesselation of non-convex polygons & polygons with holes. Should be 1 that could be implemented with ease. for non-convex: I heard breaking them up into convex using convex hull algorithms is a good choice. Is that right ?. I find different algorithms for the same. I am not constrained by time taken by the algorithm Appreciate your help!! ~ Matt

Share this post


Link to post
Share on other sites
Advertisement
Thread closing, since its essentially a recreation of a recent prior post by the same forum member. The other thread has replies already, and will remain open!

Share this post


Link to post
Share on other sites

This topic is 4973 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Guest
This topic is now closed to further replies.
Sign in to follow this  

  • Advertisement