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

Jayanth Majhi, Prosenjit Gupta, Ravi Janardan

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)229-252
Number of pages24
JournalComputational Geometry: Theory and Applications
Volume13
Issue number4
DOIs
StatePublished - Oct 1999

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

Keywords

  • Arrangements
  • Casting/molding
  • Computational geometry
  • Optimization
  • Point-set width
  • Shortest paths
  • Visibility

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