On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639): Difference between revisions

@@ Property / cites work @@
+Filling polyhedral molds.
@@ Property / cites work: Filling polyhedral molds. / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping an arrangement
@@ Property / cites work: Topologically sweeping an arrangement / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity and construction of many faces in arrangements of lines and of segments
+Normal rank
@@ Property / cites work @@
+On the union of fat wedges and separating a collection of segments by a line
+Normal rank
@@ Property / cites work @@
+Better lower bounds on detecting affine and spherical degeneracies
+Normal rank
@@ Property / cites work @@
+Fat Triangles Determine Linearly Many Holes
@@ Property / cites work: Fat Triangles Determine Linearly Many Holes / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTATIONAL GEOMETRY COLUMN 22
@@ Property / cites work: COMPUTATIONAL GEOMETRY COLUMN 22 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of the free space for a robot moving amidst fat obstacles
+Normal rank
@@ Property / cites work @@
+The visibility diagram: A data structure for visibility problems and motion planning
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank