Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere (Q3004662): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2176967780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting a Convex Polyhedron Out of a Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for cutting out polygons with lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stock cutting to minimize cutting length / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTTING OUT POLYGONS WITH LINES AND RAYS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for cutting out convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of lines and cutting out polyhedral objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank

Latest revision as of 03:34, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere
scientific article

    Statements