A tight lower bound for computing the diameter of a 3D convex polytope (Q2461545): Difference between revisions

@@ Property / cites work @@
+An efficient algorithm for the three-dimensional diameter problem
+Normal rank
@@ Property / cites work @@
+On randomized semi-algebraic test complexity
@@ Property / cites work: On randomized semi-algebraic test complexity / rank @@
+Normal rank
@@ Property / cites work @@
+APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
+Normal rank
@@ Property / cites work @@
+Splitting a Delaunay triangulation in linear time
@@ Property / cites work: Splitting a Delaunay triangulation in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of random sampling in computational geometry. II
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds for Hopcroft's problem
@@ Property / cites work: New lower bounds for Hopcroft's problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542540
@@ Property / cites work: Q4542540 / rank @@
+Normal rank
@@ Property / cites work @@
+A practical approach for computing the diameter of a point set
+Normal rank
@@ Property / cites work @@
+COMPUTING THE DIAMETER OF A POINT SET
@@ Property / cites work: COMPUTING THE DIAMETER OF A POINT SET / rank @@
+Normal rank
@@ Property / cites work @@
+Range searching with efficient hierarchical cuttings
+Normal rank
@@ Property / cites work @@
+On ray shooting in convex polytopes
@@ Property / cites work: On ray shooting in convex polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal deterministic algorithm for computing the diameter of a three-dimensional point set
+Normal rank