This chapter presents the CGAL range tree and segment tree data structures.
The range tree is theoretically superior to the -tree, but the latter often seems to perform better. However, the range tree as implemented in CGAL is more flexible than the -tree implementation, in that it enables to layer together range trees and segment trees in the same data structure.
CGAL::Range_tree_d<Data, Window, Traits>
CGAL::Segment_tree_d<Data, Window, Traits>