Search Structures

Classes
class	CGAL::Range_tree_d< Data, Window, Traits >
	A \( d\)-dimensional range tree stores points and can be used to determine all points that lie inside a given \( d\)-dimensional interval. More...
class	CGAL::Range_tree_k< Traits >
	An object of the class Range_tree_k is a \( k\)-dimensional range tree that can store k-dimensional keys of type Key. More...
class	CGAL::Segment_tree_d< Data, Window, Traits >
	A \( d\)-dimensional segment tree stores \( d\)-dimensional intervals and can be used to find all intervals that enclose, partially overlap, or contain a query interval, which may be a point. More...
class	CGAL::Segment_tree_k< Traits >
	An object of the class Segment_tree_k is a \( k\)-dimensional segment tree that can store k-dimensional intervals of type Interval. More...