A simple, faster method for kinetic proximity problems

摘要

For a set of n points in the plane, this paper presents simple kinetic data structures (KDSs) 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 KDSs for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph.