A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
A Self-adjusting Data Structure for Multidimensional Point Sets
[chapter]
2012
Lecture Notes in Computer Science
A data structure is said to be self-adjusting if it dynamically reorganizes itself to adapt to the pattern of accesses. Efficiency is typically measured in terms of amortized complexity, that is, the average running time of an access over an arbitrary sequence of accesses. The best known example of such a data structure is Sleator and Tarjan's splay tree. In this paper, we introduce a self-adjusting data structure for storing multidimensional point data. The data structure is based on a
doi:10.1007/978-3-642-33090-2_67
fatcat:ex3ixuoc4ba7jhvmzmndegpxz4