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

TL;DR

This paper presents an implementation of layered range trees with fractional cascading in C++, focusing on practical issues and using STL and generic programming techniques.

Contribution

It provides a detailed implementation of layered range trees with fractional cascading in C++, addressing practical challenges and demonstrating usage with STL and generic programming.

Findings

Implementation details of layered range trees with fractional cascading

Use of STL and generic programming techniques in implementation

Documentation of practical issues and solutions

Abstract

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.