Sign in to follow this  

polygon tesselation

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
This topic is now closed to further replies.
Sign in to follow this