Proximity problems on moving points

A kinetic data structure for the maintenance of a multidimensional range search tree is introduced. This structure is used as a building block to obtain kinetic data structures for two classical geometric proximity problems in arbitrary dlmensions: the first structure maintains the closest pair of a set of continuously moving points, and is provably efficient. The second structure maintains a spanning tree of the moving points whose cost remains within some prescribed factor of the minimum spanning tree.

[1]  Andrew Chi-Chih Yao,et al.  An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[2]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[3]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[4]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[5]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[6]  Pravin M. Vaidya.  A fast approximation for minimum spanning trees in k-dimensional space , 1984, FOCS.

[7]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[8]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[9]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[10]  Pravin M. Vaidya,et al.  Minimum Spanning Trees in k-Dimensional Space , 1988, SIAM J. Comput..

[11]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[12]  Otfried Cheong,et al.  Euclidean minimum spanning trees and bichromatic closest pairs , 1990, SCG '90.

[13]  Michiel H. M. Smid.  Maintaining the minimal distance of a point set in polylogarithmic time , 1991, SODA '91.

[14]  Otfried Cheong,et al.  Euclidean minimum spanning trees and bichromatic closest pairs , 1991, Discret. Comput. Geom..

[15]  Pankaj K. Agarwal,et al.  Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions , 1991, Comput. Geom..

[16]  David Eppstein,et al.  Dynamic half-space reporting, geometric optimization, and minimum spanning trees , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[17]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[18]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[19]  David Eppstein.  Geometric lower bounds for parametric matroid optimization , 1995, STOC '95.

[20]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[21]  David Eppstein,et al.  Dynamic Euclidean minimum spanning trees and extrema of binary functions , 1995, Discret. Comput. Geom..

[22]  Hisao Tamaki,et al.  How to cut pseudo-parabolas into segments , 1995, SCG '95.

[23]  Takeshi Tokuyama,et al.  On minimum and maximum spanning trees of linearly moving points , 1995, Discret. Comput. Geom..

[24]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[25]  Leonidas J. Guibas,et al.  Fast collision detection among multiple moving spheres , 1997, SCG '97.

[26]  Bernard Chazelle.  A faster deterministic algorithm for minimum spanning trees , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[27]  Piotr Indyk,et al.  Probabilistic analysis for combinatorial functions of moving points , 1997, SCG '97.

[28]  Tamal K. Dey,et al.  Improved Bounds for Planar k -Sets and Related Problems , 1998, Discret. Comput. Geom..

[29]  Leonidas J. Guibas,et al.  Parametric and kinetic minimum spanning trees , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[30]  Leonidas J. Guibas,et al.  Data Structures for Mobile Data , 1997, J. Algorithms.