论文信息 - An implementation of range trees with fractional cascading in C++

An implementation of range trees with fractional cascading in C++

Range trees are multidimensional binary trees which are used to perform d-dimensional orthogonal range searching. In this technical report we study the implementation issues of range trees with fractional cascading, named layered range trees. We also document our implementation of range trees with fractional cascading in C++ using STL and generic programming techniques.

Vissarion Fisikopoulos

[1] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.

[2] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.

[3] Kurt Mehlhorn,et al. Dynamic fractional cascading , 1990, Algorithmica.

[4] P. Gács,et al. Algorithms , 1992 .

[5] George S. Lueker,et al. A data structure for orthogonal range queries , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[6] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..

[7] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[8] Bjarne Stroustrup,et al. The C++ Programming Language: Special Edition , 2000 .

[9] R. Berinde. Efficient implementations of range trees , 2022 .

[10] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.

[11] Gabriele Neyer. Algorithms, complexity, and software engineering in computational geometry , 2000 .