David Eppstein
Michael T. Goodrich
ABSTRACT
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.
- S. Aluru. Quadtrees and octrees. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 19--1--19--26. Chapman & Hall/CRC, 2005.]]Google Scholar
- S. Aluru and F. E. Sevilgen. Dynamic compressed hyperoctrees with application to the N-body problem. In Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci., volume 1738 of Lecture Notes Comput. Sci., pages 21--33. Springer-Verlag, 1999.]] Google ScholarDigital Library
- S. Arya, T. Malamatos, and D. Mount. Space-efficient approximate Voronoi diagrams. In Proc. 34th Annual ACM Sympos. Theory Comput., pages 721--730, 2002.]] Google ScholarDigital Library
- S. Arya, T. Malamatos, and D. M. Mount. Space-time tradeoff for approximate spherical range counting. In 16th ACM-SIAM Annual Symposium on Discrete Algorithms, (SODA05), pages 535--544, 2005.]] Google ScholarDigital Library
- S. Arya and D. Mount. Computational geometry: Proximity and location. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 63--1--63--22. Chapman & Hall/CRC, 2005.]]Google Scholar
- S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 271--280, 1993.]] Google ScholarDigital Library
- S. Arya and D. M. Mount. Approximate range searching. Comput. Geom. Theory Appl., 17:135--152, 2000.]] Google ScholarDigital Library
- S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. ACM, 45:891--923, 1998.]] Google ScholarDigital Library
- T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. Practical use of bucketing techniques in computational geometry. In G. T. Toussaint, editor, Computational Geometry, pages 153--195. North-Holland, Amsterdam, Netherlands, 1985.]]Google ScholarCross Ref
- J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509--517, Sept. 1975.]] Google ScholarDigital Library
- M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Lett., 45:95--99, 1993.]] Google ScholarDigital Library
- M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes Comput. Sci., pages 188--199. Springer-Verlag, 1993.]] Google ScholarDigital Library
- K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pages 226--232, 1983.]]Google ScholarDigital Library
- M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.]] Google ScholarDigital Library
- L. Devroye, J. Jabbour, and C. Zamora-Cura. Squarish k-d trees. SIAM J. Comput., 30(5):1678--1700, 2000.]] Google ScholarDigital Library
- P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 9th ACM STOC, pages 365--372, 1987.]] Google ScholarDigital Library
- C. A. Duncan. Balanced Aspect Ratio Trees. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, Maryland, 1999.]] Google ScholarDigital Library
- C. A. Duncan and M. T. Goodrich. Approximate geometric query structures. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 26--1--26--17. Chapman & Hall/CRC, 2005.]]Google Scholar
- C. A. Duncan, M. T. Goodrich, and S. Kobourov. Balanced aspect ratio trees: combining the advantages of k-d trees and octrees. J. Algorithms, 38:303--333, 2001.]] Google ScholarDigital Library
- A. Efrat, M. J. Katz, F. Nielsen, and M. Sharir. Dynamic data structures for fat objects and their applications. Comput. Geom. Theory Appl., 15:215--227, 2000.]] Google ScholarDigital Library
- A. Efrat, G. Rote, and M. Sharir. On the union of fat wedges and separating a collection of segments by a line. Comput. Geom. Theory Appl., 3:277--288, 1993.]] Google ScholarDigital Library
- K. Fujimura, H. Toriya, K. Tamaguchi, and T. L. Kunii. Octree algorithms for solid modeling. In Proc. Intergraphics '83, volume B2-1, pages 1--15, 1983.]]Google Scholar
- E. N. Hanson and T. Johnson. The interval skip list: A data structure for finding all intervals that overlap a point. In Workshop on Algorithms and Data Structures (WADS), pages 153--164, 1991.]]Google ScholarCross Ref
- D. T. Lee. Interval, segment, range, and priority search trees. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 18--1--18--21. Chapman & Hall/CRC, 2005.]]Google Scholar
- S. Leutenegger and M. A. Lopez. R-trees. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 21--1--21--23. Chapman & Hall/CRC, 2005.]]Google Scholar
- M. A. Lopez and B. G. Nickerson. Analysis of half-space range search using the k-d search skip list. In 14th Canadian Conference on Computational Geometry, pages 58--62, 2002.]]Google Scholar
- J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proc. Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 367--375, 1992.]] Google ScholarDigital Library
- J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 367 -- 375, 1992.]] Google ScholarDigital Library
- B. F. Naylor. Binary space partitioning trees. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 20--1--20--19. Chapman & Hall/CRC, 2005.]]Google Scholar
- B. G. Nickerson. Skip list data structures for multidimensional data. Technical Report CS-TR-3262, 1994.]]Google Scholar
- J. Nievergelt and P. Widmayer. Spatial data structures: Concepts and design choices. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 725--764. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.]]Google Scholar
- J. A. Orenstein. Multidimensional tries used for associative searching. Inform. Process. Lett., 13:150--157, 1982.]]Google ScholarCross Ref
- W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668--676, 1990.]] Google ScholarDigital Library
- H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.]] Google ScholarDigital Library
- H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.]] Google ScholarDigital Library
- H. Samet. Spatial data structures. In W. Kim, editor, Modern Database Systems, The Object Model, Interoperability and Beyond, pages 361--385. ACM Press and Addison-Wesley, 1995.]] Google ScholarDigital Library
- H. Samet. Multidimensional data structures. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, pages 18--1--18--28. CRC Press, 1999.]]Google Scholar
- H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA, 2005.]] Google ScholarDigital Library
- H. Samet. ultidimensional spatial data structures. In D. P. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, pages 16--1--16--29. Chapman & Hall/CRC, 2005.]]Google Scholar
Index Terms
- The skip quadtree: a simple dynamic data structure for multidimensional data
Recommendations
Adaptive blocks: a high performance data structure
SC '97: Proceedings of the 1997 ACM/IEEE conference on SupercomputingWe examine a data structure which uses flexible "adaptivity" to obtain high performance for both serial and parallel computers. The data structure is an adaptive grid which partitions a given region into regular cells. Its closest relatives are cell-...
Thinning algorithms based on quadtree and octree representations
Thinning is a critical pre-processing step to obtain skeletons for pattern analysis. Quadtree and octree are hierarchical data representations in image processing and computer graphics. In this paper, we present new 2-D area-based and 3-D surface-based ...
A new quadtree-based approach for automatic quadrilateral mesh generation
In this paper, we present a new method for adaptive all-quadrilateral mesh generation for two-dimensional domains, including domains modeled by constraints with complex geometry or with varying scales. The method subdivides the domain's bounding box ...
Comments