Dynamic multi-dimensional data structures based on quad- and k—d trees
暂无分享,去创建一个
[1] George S. Lueker,et al. A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[2] Hanan Samet,et al. Deletion in two-dimensional quad trees , 1980, CACM.
[3] Jan van Leeuwen,et al. Two general methods for dynamizing decomposable searching problems , 2005, Computing.
[4] Jon Louis Bentley,et al. Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.
[5] D. Willard. Balanced Forests of K-D* Trees as a Dynamic Data Structure. , 1978 .
[6] D. Willard,et al. The Super-B-Tree Algorithm. , 1979 .
[7] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.
[8] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[9] Jon Louis Bentley,et al. Analysis of Range Searches in Quad Trees , 1975, Inf. Process. Lett..
[10] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..