A parting line for a convex polyhedron, P, is a closed curve on the surface of P. It defines the two pieces of P for which mold-halves must be made. An undercut-free parting line is one which does not create recesses or projections in P and thus allows easy de-molding of P. Computing an undercut-free parting line that is as flat as possible is an important problem in mold design. In this paper, an O(n2)-time algorithm is presented to compute such a line, according to a prescribed flatness criterion, where n is the number of vertices in P.
|Original language||English (US)|
|Title of host publication||Applied Computational Geometry|
|Subtitle of host publication||Towards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers|
|Editors||Ming C. Lin, Ming C. Lin, Dinesh Manocha|
|Number of pages||12|
|ISBN (Print)||354061785X, 9783540617853|
|State||Published - 1996|
|Event||1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996 - Philadelphia, United States|
Duration: May 27 1996 → May 28 1996
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996|
|Period||5/27/96 → 5/28/96|
Bibliographical noteFunding Information:
I Research supported in part by NSF Grant CCR-9200270 and by a University of Minnesota Grant-in-Aid of Research Award. A preliminary version of this paper appears in the Proceedings of the First ACM Workshop on Applied Computational Geometry, LNCS 1148, Springer-Verlag, 1996, pp. 109–120. ∗Corresponding author. E-mail: email@example.com 1E-mail: firstname.lastname@example.org 2Work done while at MPI-Informatik, Saarbrücken, Germany, and at the University of Minnesota, USA. E-mail: email@example.com
© Springer-Verlag Berlin Heidelberg 1996.
Copyright 2020 Elsevier B.V., All rights reserved.