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

DOI10.1016/S0925-7721(99)00023-1zbMath0948.68198OpenAlexW1979758514WikidataQ126815658 ScholiaQ126815658MaRDI QIDQ1818117

Prosenjit Gupta, Ravi Janardan, Jayanth Majhi

Publication date: 4 January 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00023-1

zbMATH Keywords

point-set width

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Casting an object with a core

This page was built for publication: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design