A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Quad trees: A data structure for retrieval by composite keys
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144192
@@ Property / cites work: Q4144192 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the all-nearest-neighbors problem
+Normal rank
@@ Property / cites work @@
+Approximate minimum weight matching on points in k-dimensional space
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank