Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
From MaRDI portal
Publication:6560224
DOI10.1007/bfb0014489zbMath1541.68405MaRDI QIDQ6560224
Ravi Janardan, Jayanth Majhi, Prosenjit Gupta
Publication date: 21 June 2024
Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
This page was built for publication: Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design