Computing and Combinatorics
From MaRDI portal
Publication:5716973
DOI10.1007/11533719zbMath1128.68523OpenAlexW4376561447MaRDI QIDQ5716973
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
Approximation algorithms for cutting a convex polyhedron out of a sphere ⋮ Cutting a convex polyhedron out of a sphere ⋮ Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere ⋮ A PTAS for cutting out polygons with lines ⋮ Cutting out polygon collections with a saw
This page was built for publication: Computing and Combinatorics
