CGAL 4.7 - dD Triangulations: Member List

\( \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.7 - dD Triangulations

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > Member List

This is the complete list of members for CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure >, including all inherited members.

are_incident_full_cells_valid(Vertex_const_handle v, bool verbose=false) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
collapse_face(const Point &p, const Face &f) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
compute_conflict_zone(const Point &p, const Full_cell_handle c, OutputIterator out) const | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
current_dimension() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Delaunay_triangulation(const int dim, const Geom_traits gt=Geom_traits()) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
difference_type typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
empty() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Face typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Facet typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Facet_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
facets_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
facets_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Finite_facet_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_facets_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_facets_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Finite_full_cell_const_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Finite_full_cell_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_full_cells_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_full_cells_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Finite_vertex_const_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Finite_vertex_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_vertices_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
finite_vertices_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
full_cell(const Facet &f) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Full_cell typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Full_cell_const_handle typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Full_cell_const_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Full_cell_handle typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Full_cell_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
full_cells_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
full_cells_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Geom_traits typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
geom_traits() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
IN_FACE enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
IN_FACET enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
IN_FULL_CELL enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
index_of_covertex(const Facet &f) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
infinite_full_cell() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
infinite_vertex() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert(ForwardIterator s, ForwardIterator e) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert(const Point &p, Full_cell_handle hint=Full_cell_handle()) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert(const Point &p, Vertex_handle hint) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert(const Point &p, const Locate_type lt, const Face &f, const Facet &ft, const Full_cell_handle c) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure >::insert(const Point p, Full_cell_handle hint=Full_cell_handle()) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure >::insert(const Point p, Locate_type loc_type, Face &f, Facet &ft, Full_cell_handle c) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_conflicting_cell(const Point &p, const Full_cell_handle c) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_face(const Point &p, const Face &f) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_facet(const Point &p, const Facet &ft) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_full_cell(const Point &p, Full_cell_handle c) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_hole(const Point &p, ForwardIterator s, ForwardIterator e, const Facet &ft, OutputIterator out) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_in_hole(const Point &p, ForwardIterator s, ForwardIterator e, const Facet &ft) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_outside_affine_hull(const Point &p) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
insert_outside_convex_hull(const Point &, Full_cell_handle c) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_in_conflict(const Point &p, Full_cell_const_handle c) const | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_infinite(const Vertex_handle v) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_infinite(const Full_cell_handle c) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_infinite(const Facet &ft) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_infinite(const Face &f) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
is_valid(bool verbose=false) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
locate(const Point &query, Full_cell_handle hint=Full_cell_handle()) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
locate(const Point &query, Vertex_handle hint) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
locate(const Point &query, Locate_type &loc_type, Face &f, Facet &ft, Full_cell_handle hint=Full_cell_handle()) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
locate(const Point &query, Locate_type &loc_type, Face &f, Vertex_handle hint) const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Locate_type enum name | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
maximal_dimension() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Maximal_dimension typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
number_of_finite_full_cells() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
number_of_full_cells() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
number_of_vertices() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
ON_VERTEX enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
operator<<(std::ostream &os, const Triangulation &t) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
operator>>(std::istream &is, Triangulation &t) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
OUTSIDE_AFFINE_HULL enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
OUTSIDE_CONVEX_HULL enum value | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Point typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
remove(Vertex_handle v) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
remove(ForwardIterator start, ForwardIterator end) | CGAL::Delaunay_triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
size_type typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
tds() const | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
tds() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Triangulation(const int dim, const Geom_traits &gt=Geom_traits()) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Triangulation(const Triangulation &t2) | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Triangulation_ds typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Vertex typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Vertex_const_handle typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Vertex_const_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Vertex_handle typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
Vertex_iterator typedef | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
vertices_begin() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |
vertices_end() | CGAL::Triangulation< DelaunayTriangulationTraits, TriangulationDataStructure > |