Sciweavers

12 search results - page 3 / 3
» Kinetic and dynamic data structures for closest pair and all...
Sort
View
COMPGEOM
2010
ACM
13 years 10 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
DEBU
2010
170views more  DEBU 2010»
13 years 5 months ago
Roads Belong in Databases
The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths a...
Jagan Sankaranarayanan, Hanan Samet