\( \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.6.1 - 2D Triangulation Data Structure
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
TriangulationDataStructure_2 Member List

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

ccw(int i) const TriangulationDataStructure_2
clear()TriangulationDataStructure_2
copy_tds(const TriangulationDataStructure_2 &tds1, Vertex_handle v=Vertex_handle())TriangulationDataStructure_2
copy_tds(const TDS_src &tds_src, typename TDS_src::Vertex_handle v, const ConvertVertex &convert_vertex, const ConvertFace &convert_face)TriangulationDataStructure_2
create_face(Face_handle f1, int i1, Face_handle f2, int i2, Face_handle f3, int i3)TriangulationDataStructure_2
create_face(Face_handle f1, int i1, Face_handle f2, int i2)TriangulationDataStructure_2
create_face(Face_handle f1, int i1, Vertex_handle v)TriangulationDataStructure_2
create_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3)TriangulationDataStructure_2
create_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle f1, Face_handle f2, Face_handle f3)TriangulationDataStructure_2
create_face()TriangulationDataStructure_2
create_vertex()TriangulationDataStructure_2
cw(int i) const TriangulationDataStructure_2
degree(Vertex_handle v) const TriangulationDataStructure_2
delete_face(Face_handle)TriangulationDataStructure_2
delete_vertex(Vertex_handle)TriangulationDataStructure_2
difference_type typedefTriangulationDataStructure_2
dim_down(Face_handle f, int i)TriangulationDataStructure_2
dimension() const TriangulationDataStructure_2
Edge typedefTriangulationDataStructure_2
Edge_circulator typedefTriangulationDataStructure_2
Edge_iterator typedefTriangulationDataStructure_2
edges_begin() const TriangulationDataStructure_2
edges_end() const TriangulationDataStructure_2
Face typedefTriangulationDataStructure_2
Face_circulator typedefTriangulationDataStructure_2
Face_handle typedefTriangulationDataStructure_2
Face_iterator typedefTriangulationDataStructure_2
faces_begin() const TriangulationDataStructure_2
faces_end() const TriangulationDataStructure_2
file_input(istream &is, bool skip_first=false)TriangulationDataStructure_2
file_output(ostream &os, Vertex_handle v=Vertex_handle(), bool skip_first=false)TriangulationDataStructure_2
flip(Face_handle f, int i)TriangulationDataStructure_2
incident_edges(Vertex_handle v, Face_handle f=Face_handle()) const TriangulationDataStructure_2
incident_faces(Vertex_handle v, Face_handle f=Face_handle()) const TriangulationDataStructure_2
incident_vertices(Vertex_handle v, Face_handle f=Face_handle()) const TriangulationDataStructure_2
insert_dim_up(Vertex_handle w, bool orient=true)TriangulationDataStructure_2
insert_first()TriangulationDataStructure_2
insert_in_edge(Face_handle f, int i)TriangulationDataStructure_2
insert_in_face(Face_handle f)TriangulationDataStructure_2
insert_second()TriangulationDataStructure_2
is_edge(Face_handle fh, int i) const TriangulationDataStructure_2
is_edge(Vertex_handle va, Vertex_handle vb) const TriangulationDataStructure_2
is_edge(Vertex_handle va, Vertex_handle vb, Face_handle &fr, int &i) const TriangulationDataStructure_2
is_face(Face_handle fh) const TriangulationDataStructure_2
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3) const TriangulationDataStructure_2
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle &fr) const TriangulationDataStructure_2
is_valid()TriangulationDataStructure_2
is_vertex(Vertex_handle v) const TriangulationDataStructure_2
make_hole(Vertex_handle v, List_edges &hole)TriangulationDataStructure_2
mirror_edge(Edge e) const TriangulationDataStructure_2
mirror_index(Face_handle f, int i) const TriangulationDataStructure_2
mirror_vertex(Face_handle f, int i) const TriangulationDataStructure_2
number_of_edges() const TriangulationDataStructure_2
number_of_faces() const TriangulationDataStructure_2
number_of_full_dim_faces() const TriangulationDataStructure_2
number_of_vertices() const TriangulationDataStructure_2
operator<<(ostream &os, const TriangulationDataStructure_3 &tds)TriangulationDataStructure_2
operator=(const TriangulationDataStructure_2 &tds1)TriangulationDataStructure_2
operator>>(istream &is, TriangulationDataStructure_3 &tds)TriangulationDataStructure_2
Rebind_face typedefTriangulationDataStructure_2
Rebind_vertex typedefTriangulationDataStructure_2
remove_degree_3(Vertex_handle v, Face_handle f=Face_handle())TriangulationDataStructure_2
remove_dim_down(Vertex_handle v)TriangulationDataStructure_2
remove_first(Vertex_handle v)TriangulationDataStructure_2
remove_second(Vertex_handle v)TriangulationDataStructure_2
set_dimension(int n)TriangulationDataStructure_2
size_type typedefTriangulationDataStructure_2
star_hole(EdgeIt edge_begin, EdgeIt edge_end)TriangulationDataStructure_2
star_hole(EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)TriangulationDataStructure_2
star_hole(Vertex_handle v, EdgeIt edge_begin, EdgeIt edge_end)TriangulationDataStructure_2
star_hole(Vertex_handle v, EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)TriangulationDataStructure_2
swap(TriangulationDataStructure_2 &tds1)TriangulationDataStructure_2
TriangulationDataStructure_2()TriangulationDataStructure_2
TriangulationDataStructure_2(const TriangulationDataStructure_2 &tds1)TriangulationDataStructure_2
Vertex typedefTriangulationDataStructure_2
Vertex_circulator typedefTriangulationDataStructure_2
Vertex_handle typedefTriangulationDataStructure_2
Vertex_iterator typedefTriangulationDataStructure_2
vertices_begin() const TriangulationDataStructure_2
vertices_end() const TriangulationDataStructure_2