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

Jayanth Majhi, Prosenjit Gupta, Ravi Janardan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationApplied Computational Geometry
Subtitle of host publicationTowards Geometric Engineering - FCRC 1996 Workshop, WACG 1996, Selected Papers
EditorsMing C. Lin, Ming C. Lin, Dinesh Manocha
PublisherSpringer Verlag
Pages109-120
Number of pages12
ISBN (Print)354061785X, 9783540617853
DOIs
StatePublished - 1996
Event1st 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 1996May 28 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1148
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st ACM Workshop on Applied Computational Geometry, WACG 1996 held as part of 2nd Federated Computing Research Conference, FCRC 1996
CountryUnited States
CityPhiladelphia
Period5/27/965/28/96

Bibliographical note

Funding 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: janardan@cs.umn.edu 1E-mail: jayanth-majhi@mentorg.com 2Work done while at MPI-Informatik, Saarbrücken, Germany, and at the University of Minnesota, USA. E-mail: pjit@excite.com

Fingerprint Dive into the research topics of 'Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design'. Together they form a unique fingerprint.

Cite this