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
TriangulationDataStructure Member List

This is the complete list of members for TriangulationDataStructure, including all inherited members.

associate_vertex_with_full_cell(Full_cell_handle c, int i, Vertex_handle v) | TriangulationDataStructure |
clear() | TriangulationDataStructure |
collapse_face(const Face &f) | TriangulationDataStructure |
current_dimension() const | TriangulationDataStructure |
delete_full_cell(Full_cell_handle c) | TriangulationDataStructure |
delete_full_cells(ForwardIterator start, ForwardIterator end) | TriangulationDataStructure |
delete_vertex(Vertex_handle v) | TriangulationDataStructure |
difference_type typedef | TriangulationDataStructure |
empty() const | TriangulationDataStructure |
Face typedef | TriangulationDataStructure |
Facet typedef | TriangulationDataStructure |
Facet_iterator typedef | TriangulationDataStructure |
facets_begin() | TriangulationDataStructure |
facets_end() | TriangulationDataStructure |
full_cell(Vertex_handle v) const | TriangulationDataStructure |
full_cell(const Facet &f) const | TriangulationDataStructure |
Full_cell typedef | TriangulationDataStructure |
Full_cell_const_handle typedef | TriangulationDataStructure |
Full_cell_data typedef | TriangulationDataStructure |
Full_cell_handle typedef | TriangulationDataStructure |
Full_cell_iterator typedef | TriangulationDataStructure |
full_cells_begin() | TriangulationDataStructure |
full_cells_end() | TriangulationDataStructure |
gather_full_cells(Full_cell_handle start, TraversalPredicate &tp, OutputIterator &out) const | TriangulationDataStructure |
incident_faces(Vertex_handle v, const int dim, OutputIterator out) | TriangulationDataStructure |
incident_full_cells(Vertex_handle v, OutputIterator out) const | TriangulationDataStructure |
incident_full_cells(const Face &f, OutputIterator out) const | TriangulationDataStructure |
index_of_covertex(const Facet &f) const | TriangulationDataStructure |
insert_in_face(const Face &f) | TriangulationDataStructure |
insert_in_facet(const Facet &ft) | TriangulationDataStructure |
insert_in_full_cell(Full_cell_handle c) | TriangulationDataStructure |
insert_in_hole(ForwardIterator start, ForwardIterator end, Facet f) | TriangulationDataStructure |
insert_in_hole(ForwardIterator start, ForwardIterator end, Facet f, OutputIterator out) | TriangulationDataStructure |
insert_increase_dimension(Vertex_handle star) | TriangulationDataStructure |
is_full_cell(const Full_cell_handle &c) const | TriangulationDataStructure |
is_valid(bool verbose=false) const | TriangulationDataStructure |
is_vertex(const Vertex_handle &v) const | TriangulationDataStructure |
maximal_dimension() const | TriangulationDataStructure |
mirror_index(Full_cell_handle c, int i) const | TriangulationDataStructure |
mirror_vertex(Full_cell_handle c, int i) const | TriangulationDataStructure |
neighbor(Full_cell_handle c, int i) const | TriangulationDataStructure |
new_full_cell() | TriangulationDataStructure |
new_vertex() | TriangulationDataStructure |
number_of_full_cells() const | TriangulationDataStructure |
number_of_vertices() const | TriangulationDataStructure |
operator<<(std::ostream &os, const TriangulationDataStructure &tds) | TriangulationDataStructure |
operator>>(std::istream &is, TriangulationDataStructure &tds) | TriangulationDataStructure |
remove_decrease_dimension(Vertex_handle v, Vertex_handle star) | TriangulationDataStructure |
set_current_dimension(int d) | TriangulationDataStructure |
set_neighbors(Full_cell_handle ci, int i, Full_cell_handle cj, int j) | TriangulationDataStructure |
size_type typedef | TriangulationDataStructure |
star(const Face &f, OutputIterator out) const | TriangulationDataStructure |
TriangulationDataStructure(int dim=0) | TriangulationDataStructure |
vertex(Full_cell_handle c, const int i) const | TriangulationDataStructure |
Vertex typedef | TriangulationDataStructure |
Vertex_const_handle typedef | TriangulationDataStructure |
Vertex_handle typedef | TriangulationDataStructure |
Vertex_iterator typedef | TriangulationDataStructure |
vertices_begin() | TriangulationDataStructure |
vertices_end() | TriangulationDataStructure |