\( \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 - 2D Triangulation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag > Member List

This is the complete list of members for CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >, including all inherited members.

all_edges_begin() const CGAL::Triangulation_2< Traits, Tds >
all_edges_end() const CGAL::Triangulation_2< Traits, Tds >
All_edges_iterator typedefCGAL::Triangulation_2< Traits, Tds >
all_faces_begin() const CGAL::Triangulation_2< Traits, Tds >
all_faces_end() const CGAL::Triangulation_2< Traits, Tds >
All_faces_iterator typedefCGAL::Triangulation_2< Traits, Tds >
all_vertices_begin() const CGAL::Triangulation_2< Traits, Tds >
all_vertices_end() const CGAL::Triangulation_2< Traits, Tds >
All_vertices_iterator typedefCGAL::Triangulation_2< Traits, Tds >
are_there_incident_constraints(Vertex_handle v) const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
ccw(int i) const CGAL::Triangulation_2< Traits, Tds >
circumcenter(Face_handle f) const CGAL::Triangulation_2< Traits, Tds >
clear()CGAL::Triangulation_2< Traits, Tds >
Constrained_Delaunay_triangulation_2(const Traits &t=Traits())CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
Constrained_Delaunay_triangulation_2(const Constrained_Delaunay_triangulation_2 &cdt1)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
Constrained_Delaunay_triangulation_2(ConstraintIterator first, ConstraintIterator last, const Traits &t=Traits())CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
constrained_edges_begin() const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
constrained_edges_end() const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
Constrained_edges_iterator typedefCGAL::Constrained_triangulation_2< Traits, Tds, Itag >
Constrained_triangulation_2()CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
Constrained_triangulation_2(const Constrained_triangulation_2 &ct1)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
Constraint typedefCGAL::Constrained_triangulation_2< Traits, Tds, Itag >
cw(int i) const CGAL::Triangulation_2< Traits, Tds >
difference_type typedefCGAL::Triangulation_2< Traits, Tds >
dimension() const CGAL::Triangulation_2< Traits, Tds >
Edge typedefCGAL::Triangulation_2< Traits, Tds >
EDGE enum valueCGAL::Triangulation_2< Traits, Tds >
Edge_circulator typedefCGAL::Triangulation_2< Traits, Tds >
Face typedefCGAL::Triangulation_2< Traits, Tds >
FACE enum valueCGAL::Triangulation_2< Traits, Tds >
Face_circulator typedefCGAL::Triangulation_2< Traits, Tds >
Face_handle typedefCGAL::Triangulation_2< Traits, Tds >
finite_edges_begin() const CGAL::Triangulation_2< Traits, Tds >
finite_edges_end() const CGAL::Triangulation_2< Traits, Tds >
Finite_edges_iterator typedefCGAL::Triangulation_2< Traits, Tds >
finite_faces_begin() const CGAL::Triangulation_2< Traits, Tds >
finite_faces_end() const CGAL::Triangulation_2< Traits, Tds >
Finite_faces_iterator typedefCGAL::Triangulation_2< Traits, Tds >
finite_vertex() const CGAL::Triangulation_2< Traits, Tds >
finite_vertices_begin() const CGAL::Triangulation_2< Traits, Tds >
finite_vertices_end() const CGAL::Triangulation_2< Traits, Tds >
Finite_vertices_iterator typedefCGAL::Triangulation_2< Traits, Tds >
flip(Face_handle &f, int i)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
CGAL::Constrained_triangulation_2::flip(Face_handle f, int i)CGAL::Triangulation_2< Traits, Tds >
geom_traits() const CGAL::Triangulation_2< Traits, Tds >
Geom_traits typedefCGAL::Triangulation_2< Traits, Tds >
get_boundary_of_conflicts(const Point &p, OutputItBoundaryEdges eit, Face_handle start) const CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
get_conflicts(const Point &p, OutputItFaces fit, Face_handle start) const CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
get_conflicts_and_boundary(const Point &p, OutputItFaces fit, OutputItBoundaryEdges eit, Face_handle start) const CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
incident_constraints(Vertex_handle v, OutputItEdges out) const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
incident_edges(Vertex_handle v) const CGAL::Triangulation_2< Traits, Tds >
incident_edges(Vertex_handle v, Face_handle f) const CGAL::Triangulation_2< Traits, Tds >
incident_faces(Vertex_handle v) const CGAL::Triangulation_2< Traits, Tds >
incident_faces(Vertex_handle v, Face_handle f) const CGAL::Triangulation_2< Traits, Tds >
incident_vertices(Vertex_handle v) const CGAL::Triangulation_2< Traits, Tds >
incident_vertices(Vertex_handle v, Face_handle f)CGAL::Triangulation_2< Traits, Tds >
includes_edge(Vertex_handle va, Vertex_handle vb, Vertex_handle &vbr, Face_handle &fr, int &i)CGAL::Triangulation_2< Traits, Tds >
inexact_locate(const Point &query, Face_handle start=Face_handle()) const CGAL::Triangulation_2< Traits, Tds >
infinite_face() const CGAL::Triangulation_2< Traits, Tds >
infinite_vertex() const CGAL::Triangulation_2< Traits, Tds >
insert(Point p, Face_handle f=Face_handle())CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert(const Point &p, Locate_type lt, Face_handle loc, int li)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert(PointIterator first, PointIterator last)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert(PointWithInfoIterator first, PointWithInfoIterator last)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
CGAL::Constrained_triangulation_2::insert(const Point &p, Locate_type &lt, Face_handle loc, int li)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
CGAL::Triangulation_2::insert(const Point &p, Face_handle f=Face_handle())CGAL::Triangulation_2< Traits, Tds >
CGAL::Triangulation_2::insert(InputIterator first, InputIterator last)CGAL::Triangulation_2< Traits, Tds >
insert_constraint(Point a, Point b)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert_constraint(Vertex_handle va, Vertex_handle vb)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert_constraint(PointIterator first, PointIterator last, bool close=false)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
CGAL::Constrained_triangulation_2::insert_constraint(const Vertex_handle &va, const Vertex_handle &vb)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
insert_constraints(ConstraintIterator first, ConstraintIterator last)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert_constraints(PointIterator points_first, PointIterator points_last, IndicesIterator indices_first, IndicesIterator indices_last)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
insert_first(const Point &p)CGAL::Triangulation_2< Traits, Tds >
insert_in_edge(const Point &p, Face_handle f, int i)CGAL::Triangulation_2< Traits, Tds >
insert_in_face(const Point &p, Face_handle f)CGAL::Triangulation_2< Traits, Tds >
insert_outside_affine_hull(const Point &p)CGAL::Triangulation_2< Traits, Tds >
insert_outside_convex_hull(const Point &p, Face_handle f)CGAL::Triangulation_2< Traits, Tds >
insert_second(const Point &p)CGAL::Triangulation_2< Traits, Tds >
Intersection_tag typedefCGAL::Constrained_triangulation_2< Traits, Tds, Itag >
is_constrained(Edge e) const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
is_edge(Vertex_handle va, Vertex_handle vb)CGAL::Triangulation_2< Traits, Tds >
is_edge(Vertex_handle va, Vertex_handle vb, Face_handle &fr, int &i)CGAL::Triangulation_2< Traits, Tds >
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3)CGAL::Triangulation_2< Traits, Tds >
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle &fr)CGAL::Triangulation_2< Traits, Tds >
is_flipable(Face_handle f, int i) const CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
is_infinite(Vertex_handle v) const CGAL::Triangulation_2< Traits, Tds >
is_infinite(Face_handle f) const CGAL::Triangulation_2< Traits, Tds >
is_infinite(Face_handle f, int i) const CGAL::Triangulation_2< Traits, Tds >
is_infinite(Edge e) const CGAL::Triangulation_2< Traits, Tds >
is_infinite(Edge_circulator ec) const CGAL::Triangulation_2< Traits, Tds >
is_infinite(All_edges_iterator ei) const CGAL::Triangulation_2< Traits, Tds >
is_valid() const CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
CGAL::Constrained_triangulation_2::is_valid(bool verbose=false, int level=0) const CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
Line_face_circulator typedefCGAL::Triangulation_2< Traits, Tds >
line_walk(const Point &p, const Point &q, Face_handle f=Face_handle()) const CGAL::Triangulation_2< Traits, Tds >
locate(const Point &query, Face_handle f=Face_handle()) const CGAL::Triangulation_2< Traits, Tds >
locate(const Point &query, Locate_type &lt, int &li, Face_handle h=Face_handle()) const CGAL::Triangulation_2< Traits, Tds >
Locate_type enum nameCGAL::Triangulation_2< Traits, Tds >
mirror_edge(Edge e) const CGAL::Triangulation_2< Traits, Tds >
mirror_index(Face_handle f, int i) const CGAL::Triangulation_2< Traits, Tds >
mirror_vertex(Face_handle f, int i) const CGAL::Triangulation_2< Traits, Tds >
move(Vertex_handle v, const Point &p)CGAL::Triangulation_2< Traits, Tds >
move_if_no_collision(Vertex_handle v, const Point &p)CGAL::Triangulation_2< Traits, Tds >
number_of_faces() const CGAL::Triangulation_2< Traits, Tds >
number_of_vertices() const CGAL::Triangulation_2< Traits, Tds >
operator<<(ostream &os, const Constrained_triangulation_2< Traits, Tds > &Ct)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >related
CGAL::Triangulation_2::operator<<(ostream &os, const Triangulation_2< Traits, Tds > &T)CGAL::Triangulation_2< Traits, Tds >related
operator=(const Triangulation_2< Traits, Tds > &tr)CGAL::Triangulation_2< Traits, Tds >
operator>>(istream &is, Constrained_triangulation_2< Traits, Tds > Ct &t)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >related
CGAL::Triangulation_2::operator>>(istream &is, const Triangulation_2< Traits, Tds > &T)CGAL::Triangulation_2< Traits, Tds >related
oriented_side(Face_handle f, const Point &p) const CGAL::Triangulation_2< Traits, Tds >
OUTSIDE_AFFINE_HULL enum valueCGAL::Triangulation_2< Traits, Tds >
OUTSIDE_CONVEX_HULL enum valueCGAL::Triangulation_2< Traits, Tds >
Point typedefCGAL::Triangulation_2< Traits, Tds >
Point_iterator typedefCGAL::Triangulation_2< Traits, Tds >
points_begin() const CGAL::Triangulation_2< Traits, Tds >
points_end() const CGAL::Triangulation_2< Traits, Tds >
propagating_flip(List_edges &edges)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
push_back(const Point &p)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
push_back(const std::pair< Point, Point > &c)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
remove(Vertex_handle &v)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
CGAL::Constrained_triangulation_2::remove(Vertex_handle v)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
remove_constrained_edge(Face_handle f, int i)CGAL::Constrained_triangulation_2< Traits, Tds, Itag >
remove_constraint(const Face_handle &f, int i)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
remove_degree_3(Vertex_handle v)CGAL::Triangulation_2< Traits, Tds >
remove_first(Vertex_handle v)CGAL::Triangulation_2< Traits, Tds >
remove_incident_constraints(Vertex_handle v)CGAL::Constrained_Delaunay_triangulation_2< Traits, Tds, Itag >
remove_second(Vertex_handle v)CGAL::Triangulation_2< Traits, Tds >
Segment typedefCGAL::Triangulation_2< Traits, Tds >
segment(Face_handle f, int i) const CGAL::Triangulation_2< Traits, Tds >
segment(const Edge &e) const CGAL::Triangulation_2< Traits, Tds >
segment(const Edge_circulator &ec) const CGAL::Triangulation_2< Traits, Tds >
segment(const Edge_iterator &ei) const CGAL::Triangulation_2< Traits, Tds >
set_infinite_vertex(const Vertex_handle &v)CGAL::Triangulation_2< Traits, Tds >
side_of_oriented_circle(Face_handle f, const Point &p)CGAL::Triangulation_2< Traits, Tds >
size_type typedefCGAL::Triangulation_2< Traits, Tds >
star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end)CGAL::Triangulation_2< Traits, Tds >
star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)CGAL::Triangulation_2< Traits, Tds >
swap(Triangulation_2 &tr)CGAL::Triangulation_2< Traits, Tds >
tds() const CGAL::Triangulation_2< Traits, Tds >
tds()CGAL::Triangulation_2< Traits, Tds >
triangle(Face_handle f) const CGAL::Triangulation_2< Traits, Tds >
Triangle typedefCGAL::Triangulation_2< Traits, Tds >
Triangulation_2(const Traits &gt=Traits())CGAL::Triangulation_2< Traits, Tds >
Triangulation_2(const Triangulation_2 &tr)CGAL::Triangulation_2< Traits, Tds >
Triangulation_cw_ccw_2()CGAL::Triangulation_cw_ccw_2
Triangulation_data_structure typedefCGAL::Triangulation_2< Traits, Tds >
Vertex typedefCGAL::Triangulation_2< Traits, Tds >
VERTEX enum valueCGAL::Triangulation_2< Traits, Tds >
Vertex_circulator typedefCGAL::Triangulation_2< Traits, Tds >
Vertex_handle typedefCGAL::Triangulation_2< Traits, Tds >