CGAL 4.7 - dD Range and Segment Trees: Class and Concept List

\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)

CGAL 4.7 - dD Range and Segment Trees

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]

CGAL |
Range_segment_tree_traits_set_2 | The class `Range_segment_tree_traits_set_2` is a range and segment tree traits class for the 2-dimensional point class from the CGAL kernel
Range_segment_tree_traits_set_3 | The class `Range_segment_tree_traits_set_3` is a range and segment tree traits class for the 3-dimensional point class from the CGAL kernel
Range_tree_traits_map_2 | The class `Range_tree_traits_map_2` is a range tree traits class for the 2-dimensional point class from the CGAL kernel, where data of type `T` is associated to each key
Range_tree_traits_map_3 | The class `Range_tree_traits_map_3` is a range and segment tree traits class for the 3-dimensional point class from the CGAL kernel, where data of type `T` is associated to each key
Segment_tree_traits_map_2 | The class `Segment_tree_traits_map_2` is a segment tree traits class for the 2-dimensional point class from the CGAL kernel, where data of type `T` is associated to each interval
Segment_tree_traits_map_3 | The class `Segment_tree_traits_map_3` is a segment tree traits class for the 3-dimensional point class from the CGAL kernel, where data of type `T` is associated to each interval
Range_tree_d | A \( d\)-dimensional range tree stores points and can be used to determine all points that lie inside a given \( d\)-dimensional interval
Range_tree_k | An object of the class `Range_tree_k` is a \( k\)-dimensional range tree that can store k-dimensional keys of type `Key`
Segment_tree_d | 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
Segment_tree_k | An object of the class `Segment_tree_k` is a \( k\)-dimensional segment tree that can store k-dimensional intervals of type `Interval`
Tree_anchor | `Tree_anchor` is also derived from `Tree_base`
tree_interval_traits | `tree_interval_traits` is a template class that provides an interface to data items
tree_point_traits | `tree_point_traits` is a template class that provides an interface to data items
RangeSegmentTreeTraits_k | A tree traits class gives the range tree and segment tree class the necessary type information of the keys and intervals. Further more, they define function objects that allow to access the keys and intervals, and provide comparison functions that are needed for window queries
Sublayer | Defines the requirements that a `Sublayer_type` of class `CGAL::Range_tree_d` or `CGAL::Segment_tree_d` has to fulfill