CGAL 5.3 - dD Triangulations
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() constTriangulationDataStructure
delete_full_cell(Full_cell_handle c)TriangulationDataStructure
delete_full_cells(ForwardIterator start, ForwardIterator end)TriangulationDataStructure
delete_vertex(Vertex_handle v)TriangulationDataStructure
difference_type typedefTriangulationDataStructure
empty() constTriangulationDataStructure
Face typedefTriangulationDataStructure
Facet typedefTriangulationDataStructure
Facet_iterator typedefTriangulationDataStructure
facets_begin()TriangulationDataStructure
facets_end()TriangulationDataStructure
full_cell(Vertex_handle v) constTriangulationDataStructure
full_cell(const Facet &f) constTriangulationDataStructure
Full_cell typedefTriangulationDataStructure
Full_cell_const_handle typedefTriangulationDataStructure
Full_cell_data typedefTriangulationDataStructure
Full_cell_handle typedefTriangulationDataStructure
Full_cell_iterator typedefTriangulationDataStructure
full_cells_begin()TriangulationDataStructure
full_cells_end()TriangulationDataStructure
gather_full_cells(Full_cell_handle start, TraversalPredicate &tp, OutputIterator &out) constTriangulationDataStructure
incident_faces(Vertex_handle v, const int dim, OutputIterator out)TriangulationDataStructure
incident_full_cells(Vertex_handle v, OutputIterator out) constTriangulationDataStructure
incident_full_cells(const Face &f, OutputIterator out) constTriangulationDataStructure
index_of_covertex(const Facet &f) constTriangulationDataStructure
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) constTriangulationDataStructure
is_valid(bool verbose=false) constTriangulationDataStructure
is_vertex(const Vertex_handle &v) constTriangulationDataStructure
maximal_dimension() constTriangulationDataStructure
mirror_index(Full_cell_handle c, int i) constTriangulationDataStructure
mirror_vertex(Full_cell_handle c, int i) constTriangulationDataStructure
neighbor(Full_cell_handle c, int i) constTriangulationDataStructure
new_full_cell()TriangulationDataStructure
new_vertex()TriangulationDataStructure
number_of_full_cells() constTriangulationDataStructure
number_of_vertices() constTriangulationDataStructure
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 typedefTriangulationDataStructure
star(const Face &f, OutputIterator out) constTriangulationDataStructure
TriangulationDataStructure(int dim=0)TriangulationDataStructure
vertex(Full_cell_handle c, const int i) constTriangulationDataStructure
Vertex typedefTriangulationDataStructure
Vertex_const_handle typedefTriangulationDataStructure
Vertex_handle typedefTriangulationDataStructure
Vertex_iterator typedefTriangulationDataStructure
vertices_begin()TriangulationDataStructure
vertices_end()TriangulationDataStructure