Kinetic and Dynamic Data Structures for Closest Pairs and All


We present simple fully dynamic and kinetic data structures, which are variants of a dynamic 2-dimensional range tree, for maintaining the closest pair and all nearest neighbors for a set of n moving points in the plane; insertions and deletions of points are also allowed. If no insertions or deletions take place, the structure for closest pair uses O(n… (More)


9 Figures and Tables

Slides referencing similar topics