Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design

Citation
J. Majhi et al., Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design, COMP GEOM, 13(4), 1999, pp. 229-252
Citations number
21
Categorie Soggetti
Engineering Mathematics
Journal title
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
ISSN journal
09257721 → ACNP
Volume
13
Issue
4
Year of publication
1999
Pages
229 - 252
Database
ISI
SICI code
0925-7721(199910)13:4<229:CAFUPL>2.0.ZU;2-T
Abstract
A parting line for a polyhedron is a closed curve on its surface, which ide ntifies 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 a n 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 cr iteria. (C) 1999 Elsevier Science B.V. All rights reserved.