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.
Issue Section:
Research Papers
Topics:
Hull
This content is only available via PDF.
Copyright © 1992
by The American Society of Mechanical Engineers
You do not currently have access to this content.