• Advertisement
Sign in to follow this  

subdividing a concave geometry into smaller convex geometries

This topic is 4494 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

As the subject suggests? I am looking for an algorithm that will devide a convex geometry (could be a 2D polygon) or a 3D closed surface (don't know what's it's called technically) like teapot, into smaller convex geometries. I guess there can be many solutions to this problem. Does anyone know which solution is the fastest and which results in the least number of resultant polygons or sub-surfaces? Thanks

Share this post


Link to post
Share on other sites
Advertisement
Guest Anonymous Poster
The term to look for in search engines and literature is "convex decomposition".

Share this post


Link to post
Share on other sites
Thanks man...that worked. I was trying phrases like
subdivision of concave polygons, or the likes...

the magic phrase is "convex decomposition"

cheers
-R

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement