Advertisement

Amortized Analysis of Smooth Quadtrees in All Dimensions

  • Huck Bennett
  • Chee Yap
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8503)

Abstract

Quadtrees are a well-known data structure for representing geometric data in the plane, and naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting a given leaf. A quadtree is smooth if adjacent leaf boxes differ by at most one in height.

In this paper, we analyze quadtrees that maintain smoothness with each split operation and also maintain neighbor pointers. Our main result shows that the smooth-split operation has an amortized cost of O(1) time for quadtrees of any fixed dimension D. This bound has exponential dependence on D which we show is unavoidable via a lower bound construction. We additionally give a lower bound construction showing an amortized cost of Ω(logn) for splits in a related quadtree model that does not maintain smoothness.

Keywords

Maximal Chain Force Chain Neighbor Query Split Operation Private Correspondence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABCC06]
    Aronov, B., Bronnimann, H., Chang, A.Y., Chiang, Y.-J.: Cost prediction for ray shooting in octrees. Computational Geometry: Theory and Applications 34(3), 159–181 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  2. [BEG94]
    Bern, M.W., Eppstein, D., Gilbert, J.R.: Provably good mesh generation. J. Comput. Syst. Sci. 48(3), 384–409 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  3. [BY]
    Bennett, H., Yap, C.: Amortized Analysis of Smooth Quadtrees in All Dimensions, http://www.cs.nyu.edu/exact/doc/smoothSubdiv2014.pdf
  4. [CLRS09]
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)Google Scholar
  5. [Cor]
    Core Library homepage. Software download, source, documentation and links: http://cs.nyu.edu/exact/core/
  6. [dBCvKO08]
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applic., 3rd edn. Springer (2008)Google Scholar
  7. [dBRS12]
    de Berg, M., Roeloffzen, M., Speckmann, B.: Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes. In: [EF 2012], pp. 383–394Google Scholar
  8. [EF12]
    Epstein, L., Ferragina, P. (eds.): ESA 2012. LNCS, vol. 7501. Springer, Heidelberg (2012)zbMATHGoogle Scholar
  9. [FB74]
    Finkel, R.A., Bentley, J.L.: Quad trees: A data structure for retrieval on composite keys. Acta Inf. 4, 1–9 (1974)CrossRefzbMATHGoogle Scholar
  10. [LSS13]
    Löffler, M., Simons, J.A., Strash, D.: Dynamic planar point location with sub-logarithmic local updates. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 499–511. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  11. [Moo92]
    Moore, D.: Simplicial Mesh Generation with Applications. PhD thesis, Cornell University (1992)Google Scholar
  12. [Moo95]
    Moore, D.: The cost of balancing generalized quadtrees. In: Symposium on Solid Modeling and Applications, pp. 305–312 (1995)Google Scholar
  13. [OvL82]
    Overmars, M.H., van Leeuwen, J.: Dynamic multi-dimensional data structures based on quad- and k-d trees. Acta Inf. 17, 267–285 (1982)CrossRefzbMATHGoogle Scholar
  14. [PM12]
    Park, E., Mount, D.M.: A self-adjusting data structure for multidimensional point sets. In: [EF 2012], pp. 778–789Google Scholar
  15. [Rup93]
    Ruppert, J.: A new and simple algorithm for quality 2-dimensional mesh generation. In: SODA, pp. 83–92. ACM/SIAM (1993)Google Scholar
  16. [Sam90a]
    Samet, H.: Applications of spatial data structures - computer graphics, image processing, and GIS. Addison-Wesley (1990)Google Scholar
  17. [Sam90b]
    Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990)Google Scholar
  18. [She]
    Sheehy, D.R.: Private correspondenceGoogle Scholar
  19. [She12]
    Sheehy, D.R.: New Bounds on the Size of Optimal Meshes. Computer Graphics Forum 31(5), 1627–1635 (2012)CrossRefGoogle Scholar
  20. [Sim]
    Simons, J.A.: Private correspondenceGoogle Scholar
  21. [WCY13]
    Wang, C., Chiang, Y.-J., Yap, C.: On soft predicates in subdivision motion planning. In: 29th SoCG, pp. 349–358. ACM (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Huck Bennett
    • 1
  • Chee Yap
    • 1
  1. 1.Department of Computer Science, Courant InstituteNew York UniversityUSA

Personalised recommendations