A clustering-based approach to kinetic closest pair (Q722518): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-017-0338-9
@@ Property / DOI: 10.1007/s00453-017-0338-9 / rank @@
-Normal rank
@@ Property / cites work @@
+Kinetic and dynamic data structures for closest pair and all nearest neighbors
+Normal rank
@@ Property / cites work @@
+Data Structures for Mobile Data
@@ Property / cites work: Data Structures for Mobile Data / rank @@
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+A Clustering-Based Approach to Kinetic Closest Pair
+Normal rank
@@ Property / cites work @@
+Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
+Normal rank
@@ Property / cites work @@
+Discrete mobile centers
@@ Property / cites work: Discrete mobile centers / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Covering a set of points in multidimensional space
+Normal rank
@@ Property / cites work @@
+Smooth kinetic maintenance of clusters
@@ Property / cites work: Smooth kinetic maintenance of clusters / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+A simple, faster method for kinetic proximity problems
+Normal rank
@@ Property / DOI @@
+.1007/S00453-017-0338-9
@@ Property / DOI: 10.1007/S00453-017-0338-9 / rank @@
+Normal rank