The skip quadtree: A simple dynamic data structure for multidimensional data

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 296-305

  Eppstein, David ^a   Goodrich, Michael T ^a   Sun, Jonathan Z ^a  

^a Irvine   (United States)

Author keywords

Approximation algorithm; Dynamic data structure; Nearest neighbor; Octree; Point location; Quadtree; Range; Skip quadtree

Indexed keywords

DATA STRUCTURES;

APPROXIMATION ALGORITHM; DYNAMIC DATA STRUCTURE; NEAREST NEIGHBOR; OCTREE; POINT LOCATION; SKIP QUADTREE;

TREES (MATHEMATICS);

EID: 33244483394     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064138     Document Type: Conference Paper

References (39)

1. S. Alum. 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.
2. 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.
3. S. Arya, T. Malamatos, and D. Mount. Space-efficient approximate Voronoi diagrams. In Proc. 34th Annual ACM Sympos. Theory Comput., pages 721-730, 2002.
4. 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.
5. 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.
6. 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.
7. S. Arya and D. M. Mount. Approximate range searching. Comput. Geom. Theory Appl., 17:135-152, 2000.
8. 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.
9. 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.
10. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, Sept. 1975.
11. M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Lett., 45:95-99, 1993.
12. 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.
13. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci., pages 226-232, 1983.
14. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
15. L. Devroye, J. Jabbour, and C. Zamora-Cura. Squarish 1k-1d trees. SIAM J. Comput., 30(5): 1678-1700, 2000.
16. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 9th ACM STOC, pages 365-372, 1987.
17. C. A. Duncan. Balanced Aspect Ratio Trees. Ph.D. thesis, Department of Computer Science, Johns Hopkins University, Baltimore, Maryland, 1999.
18. 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.
19. 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.
20. 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.
21. 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.
22. 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.
23. 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.
24. 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.
25. 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.
26. 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.
27. 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.
28. 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.
29. 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.
30. B. G. Nickerson. Skip list data structures for multidimensional data. Technical Report CS-TR-3262, 1994.
31. 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.
32. J. A. Orenstein. Multidimensional tries used for associative searching. Inform. Process. Lett., 13:150-157, 1982.
33. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
34. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.
35. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
36. 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.
37. H. Samet. Multidimensional data structures. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, pages 18-1-18-28. CRC Press, 1999.
38. H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA, 2005.
39. H. Samet. Multidimensional 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.