Filling polyhedral molds
From MaRDI portal
Publication:5060114
DOI10.1007/3-540-57155-8_249zbMath1504.68271OpenAlexW1559570104MaRDI QIDQ5060114
Godfried T. Toussaint, Prosenjit Bose, Marc J. 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
Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- On-line construction of the convex hull of a simple polyline
- A linear algorithm for finding the convex hull of a simple polygon
- On \(k\)-sets in arrangements of curves and surfaces
- Mould design with sweep operations --- a heuristic search approach
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- An optimal algorithm for intersecting line segments in the plane
- The complexity of linear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item