Simple, Faster Kinetic Data Structures

dc.contributor.authorRahmati, Zahed
dc.contributor.supervisorKing, Valerie D.
dc.contributor.supervisorWhitesides, Sue H. of Computer Scienceen_US of Philosophy Ph.D.en_US
dc.description.abstractProximity problems and point set embeddability problems are fundamental and well-studied in computational geometry and graph drawing. Examples of such problems that are of particular interest to us in this dissertation include: finding the closest pair among a set P of points, finding the k-nearest neighbors to each point p in P, answering reverse k-nearest neighbor queries, computing the Yao graph, the Semi-Yao graph and the Euclidean minimum spanning tree of P, and mapping the vertices of a planar graph to a set P of points without inducing edge crossings. In this dissertation, we consider so-called kinetic version of these problems, that is, the points are allowed to move continuously along known trajectories, which are subject to change. We design a set of data structures and a mechanism to efficiently update the data structures. These updates occur at critical, discrete times. Also, a query may arrive at any time. We want to answer queries quickly without solving problems from scratch, so we maintain solutions continuously. We present new techniques for giving kinetic solutions with better performance for some these problems, and we provide the first kinetic results for others. In particular, we provide: • A simple kinetic data structure (KDS) to maintain all the nearest neighbors and the closest pair. Our deterministic kinetic approach for maintenance of all the nearest neighbors improves the previous randomized kinetic algorithm. • An exact KDS for maintenance of the Euclidean minimum spanning tree, which improves the previous KDS. • The first KDS's for maintenance of the Yao graph and the Semi-Yao graph. • The first KDS to consider maintaining plane graphs on moving points. • The first KDS for maintenance of all the k-nearest neighbors, for any k ≥ 1. • The first KDS to answer the reverse k-nearest neighbor queries, for any k ≥ 1 in any fixed dimension, on a set of moving points.en_US
dc.rights.tempAvailable to the World Wide Weben_US
dc.subjectKinetic Data Structuresen_US
dc.subjectProximity Problemsen_US
dc.subjectPoint Set Embedding Problemen_US
dc.subjectEuclidean Minimum Spanning Treeen_US
dc.subjectClosest Pairen_US
dc.subjectAll Nearest Neighborsen_US
dc.subjectReverse k-Nearest Neighbor Queriesen_US
dc.subjectYao Graphen_US
dc.subjectSemi-Yao graphen_US
dc.titleSimple, Faster Kinetic Data Structuresen_US


Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
792.84 KB
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
1.74 KB
Item-specific license agreed upon to submission