CGAL 4.7 - 3D Triangulation Data Structure: 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 - 3D Triangulation Data Structure

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
TriangulationDataStructure_3 Member List

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

adjacent_vertices(Vertex_handle v, OutputIterator vertices) const | TriangulationDataStructure_3 |
are_equal(const Facet &f, const Facet &g) const | TriangulationDataStructure_3 |
are_equal(Cell_handle c, int i, Cell_handle n, int j) const | TriangulationDataStructure_3 |
are_equal(const Facet &f, Cell_handle n, int j) const | TriangulationDataStructure_3 |
Cell typedef | TriangulationDataStructure_3 |
Cell_circulator typedef | TriangulationDataStructure_3 |
Cell_handle typedef | TriangulationDataStructure_3 |
Cell_iterator typedef | TriangulationDataStructure_3 |
cells_begin() const | TriangulationDataStructure_3 |
cells_end() const | TriangulationDataStructure_3 |
clear() | TriangulationDataStructure_3 |
Concurrency_tag typedef | TriangulationDataStructure_3 |
copy_tds(const TriangulationDataStructure_3 &tds1, Vertex_handle v=Vertex_handle()) | TriangulationDataStructure_3 |
copy_tds(const TDS_src &tds_src, typename TDS_src::Vertex_handle v, const ConvertVertex &convert_vertex, const ConvertCell &convert_cell) | TriangulationDataStructure_3 |
create_cell(const Cell &c=Cell()) | TriangulationDataStructure_3 |
create_cell(Cell_handle c) | TriangulationDataStructure_3 |
create_cell(Vertex_handle v0, Vertex_handle v1, Vertex_handle v2, Vertex_handle v3) | TriangulationDataStructure_3 |
create_cell(Vertex_handle v0, Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Cell_handle n0, Cell_handle n1, Cell_handle n2, Cell_handle n3) | TriangulationDataStructure_3 |
create_vertex(const Vertex &v=Vertex()) | TriangulationDataStructure_3 |
create_vertex(Vertex_handle v) | TriangulationDataStructure_3 |
decrease_dimension(Cell_handle c, int i) | TriangulationDataStructure_3 |
degree(Vertex_handle v) const | TriangulationDataStructure_3 |
delete_cell(Cell_handle c) | TriangulationDataStructure_3 |
delete_cells(CellIt first, CellIt last) | TriangulationDataStructure_3 |
delete_vertex(Vertex_handle v) | TriangulationDataStructure_3 |
delete_vertices(VertexIt first, VertexIt last) | TriangulationDataStructure_3 |
difference_type typedef | TriangulationDataStructure_3 |
dimension() const | TriangulationDataStructure_3 |
Edge typedef | TriangulationDataStructure_3 |
Edge_iterator typedef | TriangulationDataStructure_3 |
edges_begin() const | TriangulationDataStructure_3 |
edges_end() const | TriangulationDataStructure_3 |
Facet typedef | TriangulationDataStructure_3 |
Facet_circulator typedef | TriangulationDataStructure_3 |
Facet_iterator typedef | TriangulationDataStructure_3 |
facets_begin() const | TriangulationDataStructure_3 |
facets_end() const | TriangulationDataStructure_3 |
flip(Edge e) | TriangulationDataStructure_3 |
flip(Cell_handle c, int i, int j) | TriangulationDataStructure_3 |
flip(Facet f) | TriangulationDataStructure_3 |
flip(Cell_handle c, int i) | TriangulationDataStructure_3 |
flip_flippable(Edge e) | TriangulationDataStructure_3 |
flip_flippable(Cell_handle c, int i, int j) | TriangulationDataStructure_3 |
flip_flippable(Facet f) | TriangulationDataStructure_3 |
flip_flippable(Cell_handle c, int i) | TriangulationDataStructure_3 |
has_vertex(const Facet &f, Vertex_handle v, int &j) const | TriangulationDataStructure_3 |
has_vertex(Cell_handle c, int i, Vertex_handle v, int &j) const | TriangulationDataStructure_3 |
has_vertex(const Facet &f, Vertex_handle v) const | TriangulationDataStructure_3 |
has_vertex(Cell_handle c, int i, Vertex_handle v) const | TriangulationDataStructure_3 |
incident_cells(const Edge &e) const | TriangulationDataStructure_3 |
incident_cells(Cell_handle c, int i, int j) const | TriangulationDataStructure_3 |
incident_cells(const Edge &e, Cell_handle start) const | TriangulationDataStructure_3 |
incident_cells(Cell_handle c, int i, int j, Cell_handle start) const | TriangulationDataStructure_3 |
incident_cells(Vertex_handle v, OutputIterator cells) const | TriangulationDataStructure_3 |
incident_edges(Vertex_handle v, OutputIterator edges) const | TriangulationDataStructure_3 |
incident_facets(Edge e) const | TriangulationDataStructure_3 |
incident_facets(Cell_handle c, int i, int j) const | TriangulationDataStructure_3 |
incident_facets(Edge e, Facet start) const | TriangulationDataStructure_3 |
incident_facets(Edge e, Cell_handle start, int f) const | TriangulationDataStructure_3 |
incident_facets(Cell_handle c, int i, int j, Facet start) const | TriangulationDataStructure_3 |
incident_facets(Cell_handle c, int i, int j, Cell_handle start, int f) const | TriangulationDataStructure_3 |
incident_facets(Vertex_handle v, OutputIterator facets) const | TriangulationDataStructure_3 |
insert_in_cell(Cell_handle c) | TriangulationDataStructure_3 |
insert_in_edge(Edge e) | TriangulationDataStructure_3 |
insert_in_edge(Cell_handle c, int i, int j) | TriangulationDataStructure_3 |
insert_in_facet(const Facet &f) | TriangulationDataStructure_3 |
insert_in_facet(Cell_handle c, int i) | TriangulationDataStructure_3 |
insert_in_hole(CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i) | TriangulationDataStructure_3 |
insert_in_hole(CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i, Vertex_handle newv) | TriangulationDataStructure_3 |
insert_increase_dimension(Vertex_handle star=Vertex_handle()) | TriangulationDataStructure_3 |
is_cell(Cell_handle c) const | TriangulationDataStructure_3 |
is_cell(Vertex_handle u, Vertex_handle v, Vertex_handle w, Vertex_handle t, Cell_handle &c, int &i, int &j, int &k, int &l) const | TriangulationDataStructure_3 |
is_edge(Cell_handle c, int i, int j) const | TriangulationDataStructure_3 |
is_edge(Vertex_handle u, Vertex_handle v, Cell_handle &c, int &i, int &j) const | TriangulationDataStructure_3 |
is_edge(Vertex_handle u, Vertex_handle v) const | TriangulationDataStructure_3 |
is_facet(Cell_handle c, int i) const | TriangulationDataStructure_3 |
is_facet(Vertex_handle u, Vertex_handle v, Vertex_handle w, Cell_handle &c, int &i, int &j, int &k) const | TriangulationDataStructure_3 |
is_valid(bool verbose=false) const | TriangulationDataStructure_3 |
is_valid(Vertex_handle v, bool verbose=false) const | TriangulationDataStructure_3 |
is_valid(Cell_handle c, bool verbose=false) const | TriangulationDataStructure_3 |
is_vertex(Vertex_handle v) const | TriangulationDataStructure_3 |
mirror_facet(Facet f) const | TriangulationDataStructure_3 |
mirror_index(Cell_handle c, int i) const | TriangulationDataStructure_3 |
mirror_vertex(Cell_handle c, int i) const | TriangulationDataStructure_3 |
number_of_cells() const | TriangulationDataStructure_3 |
number_of_edges() const | TriangulationDataStructure_3 |
number_of_facets() const | TriangulationDataStructure_3 |
number_of_vertices() const | TriangulationDataStructure_3 |
operator<<(ostream &os, const TriangulationDataStructure_3 &tds) | TriangulationDataStructure_3 |
operator=(const TriangulationDataStructure_3 &tds1) | TriangulationDataStructure_3 |
operator>>(istream &is, TriangulationDataStructure_3 &tds) | TriangulationDataStructure_3 |
raw_cells_begin() const | TriangulationDataStructure_3 |
raw_cells_end() const | TriangulationDataStructure_3 |
Rebind_cell typedef | TriangulationDataStructure_3 |
Rebind_vertex typedef | TriangulationDataStructure_3 |
remove_decrease_dimension(Vertex_handle v, Vertex_handle w=v) | TriangulationDataStructure_3 |
remove_from_maximal_dimension_simplex(Vertex_handle v) | TriangulationDataStructure_3 |
reorient() | TriangulationDataStructure_3 |
set_dimension(int n) | TriangulationDataStructure_3 |
size_type typedef | TriangulationDataStructure_3 |
swap(TriangulationDataStructure_3 &tds1) | TriangulationDataStructure_3 |
TriangulationDataStructure_3() | TriangulationDataStructure_3 |
TriangulationDataStructure_3(const TriangulationDataStructure_3 &tds1) | TriangulationDataStructure_3 |
Vertex typedef | TriangulationDataStructure_3 |
Vertex_handle typedef | TriangulationDataStructure_3 |
Vertex_iterator typedef | TriangulationDataStructure_3 |
vertices_begin() const | TriangulationDataStructure_3 |
vertices_end() const | TriangulationDataStructure_3 |