Saliwanchik, Lloyd & Eisenschenk
Voronoi diagram-based algorithm for efficient progressive continuous range query for moving objects
Devices and methods for providing Voronoi diagram-based progressive continuous range query (CRQ) computation for location-based services are provided. A method can include indexing all interest points using a Voronoi R-tree data structure in a server-side computing device. When a client mobile device sends a CRQ request, the server-side device receives a path of travel and builds a list to store interest points and a min-heap to store split points, iteratively retrieving split points from the min-heap, and reporting the CRQ result progressively until a termination condition is reached.
The Florida International University Board of Trustees
H H H
H04W H04W H04W
inventional inventional inventional
Jahkell Weitong Mingjin Naphtali Tao
Lazarre Liu Zhang Rishe Li