@inproceedings{795d6a81b466411082d9d817fdebbebf,

title = "Amortized analysis of smooth quadtrees in all dimensions",

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 Ω(log n) for splits in a related quadtree model that does not maintain smoothness.",

author = "Huck Bennett and Chee Yap",

year = "2014",

doi = "10.1007/978-3-319-08404-6_4",

language = "English (US)",

isbn = "9783319084039",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "38--49",

booktitle = "Algorithm Theory, SWAT 2014 - 14th Scandinavian Symposium and Workshops, Proceedings",

note = "14th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014 ; Conference date: 02-07-2014 Through 04-07-2014",

}