a Mentor Graphics Corp., 8005 S.W. Boeckman Rd., Wilsonville, OR, 97070, USA
b Delsoft (India), Pvt. Ltd., Calcutta, India
c Department of Computer Science, University of Minnesota, Minneapolis, MN, 55455, USA
Abstract:
A parting line for a polyhedron is a closed curve on its surface, which identifies the two halves of the polyhedron for which mold-boxes must be made. A parting line is undercut-free if the two halves that it generates do not contain facets that obstruct the de-molding of the polyhedron. Computing an undercut-free parting line that is as “flat” as possible is an important problem in mold design. In this paper, algorithms are presented to compute such a parting line for a convex polyhedron, based on different flatness criteria.