CGAL 6.3 - 2D Hyperbolic Delaunay Triangulations
Loading...
Searching...
No Matches
Reference Manual

Mikhail Bogdanov, Iordan Iordanov, and Monique Teillaud
This package enables building and handling Delaunay triangulations of point sets in the Poincaré disk model of the hyperbolic plane. Triangulations are built incrementally and can be modified by insertion and removal of vertices; point location facilities are also offered, as well as primitives to build the dual Voronoi diagrams.
Introduced in: CGAL 4.14
Depends on: 2D Triangulations
BibTeX: cgal:bt-ht2-17-26a
License: GPL
Windows Demo: Hyperbolic Delaunay Triangulation

The Delaunay triangulation of a set of points \(P\) in the hyperbolic plane \(\mathbb H^2\) is a two-dimensional connected simplicial complex with vertex set defined by the points \(P\).

Classified Reference Pages

Concepts

  • HyperbolicDelaunayTriangulationTraits_2 describes the requirements for an interface for geometric objects, constructions, and predicates in the hyperbolic plane.
  • HyperbolicTriangulationFaceBase_2 describes the requirements for faces of the hyperbolic Delaunay triangulation.
  • HyperbolicFaceData describes the requirements for a hyperbolic marker of faces of the hyperbolic Delaunay triangulation, used to filter faces of the Euclidean Delaunay triangulation.

Classes

Two models for the concept HyperbolicDelaunayTriangulationTraits_2 are provided:

The model CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2 is faster than CGAL::Hyperbolic_Delaunay_triangulation_traits_2 for points with rational coordinates.

Topics

 Concepts
 Main Classes
 Traits Classes
 Face Classes