Article thumbnail

A Modified Algorithm for Convex Decomposition of 3D Polyhedra

By Gleb Belov

Abstract

This paper presents implementation details of a simple algorithm to compute a convex decomposition of a non-convex polyhedron without shells (internal voids). For such a polyhedron S with n edges and r notches (features causing non-convexity in polyhedra), the algorithm produces a worst-case optimal O(r²) number of convex polyhedra S i with [ i S i = S in O(nr ) time and O(nr²+ r ) space. The algorithm repeatedly cuts and splits polyhedra along planes that resolve notches. It works also for certain classes of non-manifold polyhedra. The algorithm is constructed for the finite precision input information. Thus, questions of numerical stability must be considered. Making geometric decisions in terms of whole facets, we obtain a robust and simple version of the algorithm

Topics: robust computations, geometric modeling
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.5.4593
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.tu-dresden.de/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.