\( \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.8 - dD Range and Segment Trees

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Sublayer Concept Reference
Concepts

## Definition

Defines the requirements that a `Sublayer_type` of class `CGAL::Range_tree_d` or `CGAL::Segment_tree_d` has to fulfill.

First of all, the class has to be derived from the abstract base class `CGAL::Tree_base` and therefore has to provide methods `make_tree`, `window_query`, `enclosing_query` and `is_inside` with the same parameter types as the instantiated class `Range_tree_d` or `Segment_tree_d`, respectively. Furthermore a method `bool is_anchor()` has to be provided. If the `Sublayer_type` class builds a recursion anchor for class `Segment_tree_d`, this function is expected to return `true`, `false` otherwise.

Such a recursion anchor class is provided by the class class. `CGAL::Tree_anchor<Data, Window>`.