A simple, faster method for kinetic proximity problems

  title={A simple, faster method for kinetic proximity problems},
  author={Zahed Rahmati and Mohammad Ali Abam and Valerie King and Sue Whitesides and Alireza Zarei},
  journal={Comput. Geom.},
For a set of n points in the plane, this paper presents simple kinetic data structures (KDS’s) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS’s for maintenance of two well-studied sparse proximity… CONTINUE READING