On algorithmic complexity of imprecise spanners (Q6071451): Difference between revisions

@@ Property / cites work @@
+On the power of the semi-separated pair decomposition
+Normal rank
@@ Property / cites work @@
+Region-fault tolerant geometric spanners
@@ Property / cites work: Region-fault tolerant geometric spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing imprecise points for Delaunay triangulation: simplified and extended
+Normal rank
@@ Property / cites work @@
+A decomposition of multidimensional point sets with applications to             <i>k</i>             -nearest-neighbors and             <i>n</i>             -body potential fields
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating input-constrained planar point sets
@@ Property / cites work: Triangulating input-constrained planar point sets / rank @@
+Normal rank
@@ Property / cites work @@
+Unions of Onions: Preprocessing Imprecise Points for Fast Onion
  Decomposition
+Normal rank
@@ Property / cites work @@
+Largest and smallest convex hulls for imprecise points
+Normal rank
@@ Property / cites work @@
+Largest bounding box, smallest diameter, and related problems on imprecise points
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank