CGAL data structures used for 2D Delaunay meshing. More...

Include dependency graph for CGALTriangulation2Ddefs.H:

This graph shows which files directly or indirectly include this file:

Typedefs
typedef CGAL::indexedVertex< K >	Vb

typedef CGAL::indexedFace< K >	Fb

typedef CGAL::Triangulation_data_structure_2< Vb, Fb >	Tds

typedef CGAL::Delaunay_triangulation_2< K, Tds >	Delaunay

Detailed Description

CGAL data structures used for 2D Delaunay meshing.

Original source file CGALTriangulation2Ddefs.H

Typedefs CGALTriangulation2Ddefs

Define CGAL_INEXACT to use Exact_predicates_inexact_constructions kernel otherwise the more robust but much less efficient Exact_predicates_exact_constructions will be used.

Define CGAL_HIERARCHY to use hierarchical Delaunay triangulation which is faster but uses more memory than the standard Delaunay triangulation.

Definition in file CGALTriangulation2Ddefs.H.

Typedef Documentation

◆ Vb

typedef CGAL::indexedVertex<K> Vb

Definition at line 49 of file CGALTriangulation2Ddefs.H.

◆ Fb

typedef CGAL::indexedFace<K> Fb

Definition at line 50 of file CGALTriangulation2Ddefs.H.

◆ Tds

typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds

Definition at line 66 of file CGALTriangulation2Ddefs.H.

◆ Delaunay

typedef CGAL::Delaunay_triangulation_2<K, Tds> Delaunay

Definition at line 67 of file CGALTriangulation2Ddefs.H.