Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Approximate closest-point queries in high dimensions
Information Processing Letters
On the union of fat wedges and separating a collection of segments by a line
Computational Geometry: Theory and Applications
Modern database systems
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic data structures for fat objects and their applications
Computational Geometry: Theory and Applications
Multidimensional binary search trees used for associative searching
Communications of the ACM
Computational Geometry: Theory and Applications
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Journal of Algorithms
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Parallel Construction of Quadtrees and Quality Triangulations
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Balanced aspect ratio trees
Space-time tradeoffs for approximate spherical range counting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Dimensionality reduction for long duration and complex spatio-temporal queries
Proceedings of the 2007 ACM symposium on Applied computing
Fully dynamic geometric spanners
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Geometry: Theory and Applications
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
ACM Transactions on Algorithms (TALG)
SONMAS: a structured overlay network for multidimensional attribute space
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Efficient colored point set matching under noise
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
A unified approach to approximate proximity searching
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Noisy colored point set matching
Discrete Applied Mathematics
Practical nearest neighbor search in the plane
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A grid-based index and queries for large-scale geo-tagged video collections
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
Dynamic point-region quadtrees for particle simulations
Information Sciences: an International Journal
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d 2). Our data structure combines the best features of two well-known data structures, in that it has the well-defined "box"-shaped regions of region quadtrees and the logarithmic-height search and update hierarchical structure of skip lists. Indeed, the bottom level of our structure is exactly a region quadtree (or octree for higher dimensional data). We describe efficient algorithms for inserting and deleting points in a skip quadtree, as well as fast methods for performing point location, approximate range, and approximate nearest neighbor queries.