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

@@ Property / cites work @@
+Cutting a Convex Polyhedron Out of a Sphere
@@ Property / cites work: Cutting a Convex Polyhedron Out of a Sphere / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for cutting out polygons with lines
@@ Property / cites work: A PTAS for cutting out polygons with lines / rank @@
+Normal rank
@@ Property / cites work @@
+Stock cutting to minimize cutting length
@@ Property / cites work: Stock cutting to minimize cutting length / rank @@
+Normal rank
@@ Property / cites work @@
+CUTTING OUT POLYGONS WITH LINES AND RAYS
@@ Property / cites work: CUTTING OUT POLYGONS WITH LINES AND RAYS / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for cutting out convex polygons
+Normal rank
@@ Property / cites work @@
+Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sets of lines and cutting out polyhedral objects
@@ Property / cites work: Sets of lines and cutting out polyhedral objects / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank