Filling polyhedral molds

DOI10.1007/3-540-57155-8_249MaRDI QIDQ5060114zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Godfried Toussaint, Marc Van Kreveld

Publication date 18 January 2023

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

Full work available at URL https://doi.org/10.1007/3-540-57155-8_249

Mathematics Subject Classification ID

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

Recommendations

• Filling polyhedral molds.
• Moldable and castable polygons
• Parting directions for mould and die design
• Determining the castability of simple polyhedra
• scientific article; zbMATH DE number 1979506

Cites work

• A linear algorithm for finding the convex hull of a simple polygon
• An optimal algorithm for intersecting line segments in the plane
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3945379 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Mould design with sweep operations --- a heuristic search approach
• On \(k\)-sets in arrangements of curves and surfaces
• On-line construction of the convex hull of a simple polyline
• The complexity of linear programming

Cited in

(4)

• Parting directions for mould and die design
• Filling polyhedral molds.
• Exact and approximation algorithms for computing optimal fat decompositions
• Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design

This page was built for publication: Filling polyhedral molds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060114)