Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Planar spanners and approximate shortest path queries among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Q3140432
@@ Property / cites work: Q3140432 / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained Delaunay triangulations
@@ Property / cites work: Constrained Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+\(L_ 1\) shortest paths among polygonal obstacles in the plane
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear shortest paths in the presence of rectangular barriers
+Normal rank
@@ Property / cites work @@
+CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
@@ Property / cites work: CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+A sparse graph almost as good as the complete graph on points in \(k\) dimensions
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
+Normal rank