CGAL 4.7 - 2D Periodic Triangulations
|
Classes | |
class | CGAL::Periodic_2_Delaunay_triangulation_2< Traits, Tds > |
The class Periodic_2_Delaunay_triangulation_2 represents a Delaunay triangulation in two-dimensional periodic space. More... | |
class | CGAL::Periodic_2_offset_2 |
The class Periodic_2_offset_2 is a model of the concept Periodic_2Offset_2 . More... | |
class | CGAL::Periodic_2_triangulation_2< Traits, Tds > |
The class Periodic_2_triangulation_2 represents a 2-dimensional triangulation of a point set in \( \mathbb T_c^2\). More... | |
class | CGAL::Periodic_2_triangulation_hierarchy_2< PTr > |
The class Periodic_2_triangulation_hierarchy_2 implements a triangulation augmented with a data structure which allows fast point location queries. More... | |
Enumerations | |
enum | CGAL::Periodic_2_triangulation_2< Traits, Tds >::Iterator_type { CGAL::Periodic_2_triangulation_2< Traits, Tds >::STORED = 0, CGAL::Periodic_2_triangulation_2< Traits, Tds >::UNIQUE, CGAL::Periodic_2_triangulation_2< Traits, Tds >::STORED_COVER_DOMAIN, CGAL::Periodic_2_triangulation_2< Traits, Tds >::UNIQUE_COVER_DOMAIN } |
The enum Iterator_type is defined by Periodic_2_triangulation_2 to specify the behavior of geometric iterators. More... | |
enum | CGAL::Periodic_2_triangulation_2< Traits, Tds >::Locate_type { CGAL::Periodic_2_triangulation_2< Traits, Tds >::VERTEX = 0, CGAL::Periodic_2_triangulation_2< Traits, Tds >::EDGE, CGAL::Periodic_2_triangulation_2< Traits, Tds >::FACE, CGAL::Periodic_2_triangulation_2< Traits, Tds >::EMPTY } |
The enum @ is defined by Periodic_2_triangulation_2 to specify which case occurs when locating a point in the triangulation. More... | |
enum CGAL::Periodic_2_triangulation_2::Iterator_type |
The enum Iterator_type is defined by Periodic_2_triangulation_2
to specify the behavior of geometric iterators.
Enumerator | |
---|---|
STORED |
Return all geometric primitives as they are stored internally in |
UNIQUE |
Return only one representative of each geometric primitive even if the triangulation is computed in a multiply sheeted covering space. Choose the representative whose maximum offset is minimal but non-negative in each direction of space. |
STORED_COVER_DOMAIN |
Same as |
UNIQUE_COVER_DOMAIN |
Same as |
enum CGAL::Periodic_2_triangulation_2::Locate_type |
The enum @
is defined by Periodic_2_triangulation_2
to specify which case occurs when locating a point in the triangulation.
If the triangulation does not contain any points EMPTY
is returned.