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

This is the complete list of members for CGAL::Regular_triangulation_2< Traits, Tds >, 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::Regular_triangulation_2< Traits, Tds >
all_vertices_end() const CGAL::Regular_triangulation_2< Traits, Tds >
All_vertices_iterator typedefCGAL::Regular_triangulation_2< Traits, Tds >
Bare_point typedefCGAL::Regular_triangulation_2< Traits, Tds >
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 >
cw(int i) const CGAL::Triangulation_2< Traits, Tds >
difference_type typedefCGAL::Triangulation_2< Traits, Tds >
dimension() const CGAL::Triangulation_2< Traits, Tds >
Distance typedefCGAL::Regular_triangulation_2< Traits, Tds >
draw_dual(Stream &ps)CGAL::Regular_triangulation_2< Traits, Tds >
dual(const Face_handle &f) const CGAL::Regular_triangulation_2< Traits, Tds >
dual(const Edge &e) const CGAL::Regular_triangulation_2< Traits, Tds >
dual(const Edge_circulator &ec) const CGAL::Regular_triangulation_2< Traits, Tds >
dual(const Edge_iterator &ei) const CGAL::Regular_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::Regular_triangulation_2< Traits, Tds >
finite_vertices_end() const CGAL::Regular_triangulation_2< Traits, Tds >
Finite_vertices_iterator typedefCGAL::Regular_triangulation_2< Traits, Tds >
flip(Face_handle f, int i)CGAL::Triangulation_2< Traits, Tds >
Geom_traits typedefCGAL::Triangulation_2< Traits, Tds >
geom_traits() const CGAL::Triangulation_2< Traits, Tds >
get_boundary_of_conflicts(const Point &p, OutputItBoundaryEdges eit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_boundary_of_conflicts_and_hidden_vertices(const Weighted_point &p, OutputItBoundaryEdges eit, OutputItHiddenVertices vit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_conflicts(const Point &p, OutputItFaces fit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_conflicts_and_boundary(const Weighted_point &p, OutputItFaces fit, OutputItBoundaryEdges eit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_conflicts_and_boundary_and_hidden_vertices(const Weighted_point &p, OutputItFaces fit, OutputItBoundaryEdges eit, OutputItHiddenVertices vit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_conflicts_and_hidden_vertices(const Weighted_point &p, OutputItFaces fit, OutputItHiddenVertices vit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
get_hidden_vertices(const Point &p, OutputItHiddenVertices vit, Face_handle start) const CGAL::Regular_triangulation_2< Traits, Tds >
hidden_vertices_begin() const CGAL::Regular_triangulation_2< Traits, Tds >
hidden_vertices_end() const CGAL::Regular_triangulation_2< Traits, Tds >
Hidden_vertices_iterator typedefCGAL::Regular_triangulation_2< Traits, Tds >
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(const Weighted_point &p, Face_handle f=Face_handle())CGAL::Regular_triangulation_2< Traits, Tds >
insert(const Weighted_point &p, Locate_type lt, Face_handle loc, int li)CGAL::Regular_triangulation_2< Traits, Tds >
insert(InputIterator first, InputIterator last)CGAL::Regular_triangulation_2< Traits, Tds >
insert(WeightedPointWithInfoInputIterator first, WeightedPointWithInfoInputIterator last)CGAL::Regular_triangulation_2< Traits, Tds >
CGAL::Triangulation_2::insert(const Point &p, Face_handle f=Face_handle())CGAL::Triangulation_2< Traits, Tds >
CGAL::Triangulation_2::insert(const Point &p, Locate_type lt, Face_handle loc, int li)CGAL::Triangulation_2< Traits, Tds >
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 >
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_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(bool verbose=false, int level=0) const CGAL::Regular_triangulation_2< Traits, Tds >
Line typedefCGAL::Regular_triangulation_2< Traits, Tds >
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 >
nearest_power_vertex(Bare_point p) const CGAL::Regular_triangulation_2< Traits, Tds >
number_of_faces() const CGAL::Triangulation_2< Traits, Tds >
number_of_hidden_vertices() const CGAL::Regular_triangulation_2< Traits, Tds >
number_of_vertices() const CGAL::Regular_triangulation_2< Traits, Tds >
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, 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 >
power_test(Face_handle f, const Weighted_point &p) const CGAL::Regular_triangulation_2< Traits, Tds >
push_back(const Point &p)CGAL::Regular_triangulation_2< Traits, Tds >
Ray typedefCGAL::Regular_triangulation_2< Traits, Tds >
Regular_triangulation_2(const Traits &gt=Traits())CGAL::Regular_triangulation_2< Traits, Tds >
Regular_triangulation_2(const Regular_triangulation_2 &rt)CGAL::Regular_triangulation_2< Traits, Tds >
Regular_triangulation_2(InputIterator first, InputIterator last, Traits gt=Traits())CGAL::Regular_triangulation_2< Traits, Tds >
remove(Vertex_handle v)CGAL::Regular_triangulation_2< Traits, Tds >
remove_degree_3(Vertex_handle v)CGAL::Triangulation_2< Traits, Tds >
remove_first(Vertex_handle v)CGAL::Triangulation_2< Traits, Tds >
remove_second(Vertex_handle v)CGAL::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 >
Segment typedefCGAL::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 enum valueCGAL::Triangulation_2< Traits, Tds >
Vertex typedefCGAL::Triangulation_2< Traits, Tds >
Vertex_circulator typedefCGAL::Triangulation_2< Traits, Tds >
Vertex_handle typedefCGAL::Triangulation_2< Traits, Tds >
weighted_circumcenter(const Face_handle &f) const CGAL::Regular_triangulation_2< Traits, Tds >
Weighted_point typedefCGAL::Regular_triangulation_2< Traits, Tds >