Abstract
To exploit convexity, a non-convex object can be represented by a boolean combination of convex components. A convex decomposition method of polyhedral objects uses convex hulls and set difference operations. This decomposition, however, may not converge. In this article, we formalize this decomposition method and find local cause of non-convergence.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
