On some geometric optimization problems in layered manufacturing

DOI10.1007/3-540-63307-3_54zbMath1497.68535OpenAlexW1493408602MaRDI QIDQ5096933

Prosenjit Gupta, Jayanth Majhi, Ravi Janardan, Michiel H. M. Smid

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11299/215315

zbMATH Keywords

convex polyhedronvolume formulalayered manufacturingplane constraintblue point

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Production models (90B30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Range searching with efficient hierarchical cuttings
• The power of geometric duality
• Topologically sweeping an arrangement
• On some geometric optimization problems in layered manufacturing
• Feasibility of design in stereolithography
• Filling polyhedral molds.
• On a class of \(O(n^ 2)\) problems in computational geometry
• On minimum-area hulls