\( \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 - 2D Triangulation

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Triangulation_hierarchy_2< Tr > Class Template Reference
Triangulation Classes

`#include <CGAL/Triangulation_hierarchy_2.h>`

## Inherits from

Tr.

## Definition

The class `Triangulation_hierarchy_2` implements a triangulation augmented with a data structure which allows fast point location queries.

The data structure is a hierarchy of triangulations. The triangulation at the lowest level is the original triangulation where operations and point location are to be performed. Then at each succeeding level, the data structure stores a triangulation of a small random sample of the vertices of the triangulation at the preceding level.

Point location is done through a top-down nearest neighbor query. The nearest neighbor query is first performed naively in the top level triangulation. Then, at each following level, the nearest neighbor at that level is found through a linear walk performed from the nearest neighbor found at the preceding level.

Because the number of vertices in each triangulation is only a small fraction of the number of vertices of the preceding triangulation the data structure remains small and achieves fast point location queries on real data. As proved in [3], this structure has an optimal behavior when it is built for Delaunay triangulations. However it can be used as well for other triangulations.

Template Parameters

  Tr | may be any of the CGAL triangulation classes.

Types

The class `Triangulation_hierarchy_2` inherits the types from its base triangulation class `Tr`.

The class `Triangulation_hierarchy_2` offers exactly the same functionalities as the triangulation Tr does. Location queries are overloaded to benefit from the data structure. Modifiers (insertion, removal, and displacement) are overloaded to take care of updating the data structure.

Be careful that I/O operations are not overloaded. Writing a `Triangulation_hierarchy_2` into a file writes only the lowest level triangulation and drops the hierarchy and reading it from a file results in a triangulation whose efficiency will be that of an ordinary triangulation.

See Also
  `CGAL::Triangulation_2<Traits,Tds>`
  `CGAL::Delaunay_triangulation_2<Traits,Tds>`
  `TriangulationHierarchyVertexBase_2`
  `CGAL::Triangulation_hierarchy_vertex_base_2<Vb>`

Examples:
  Triangulation_2/constrained_hierarchy_plus.cpp, and Triangulation_2/hierarchy.cpp.