\( \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.13 - 2D Range and Neighbor Search
CGAL::Point_set_2< Gt, Tds > Member List

This is the complete list of members for CGAL::Point_set_2< Gt, Tds >, including all inherited members.

all_edges_begin() constCGAL::Triangulation_2< class, class >
all_edges_end() constCGAL::Triangulation_2< class, class >
All_edges_iterator typedefCGAL::Triangulation_2< class, class >
all_faces_begin() constCGAL::Triangulation_2< class, class >
all_faces_end() constCGAL::Triangulation_2< class, class >
All_faces_iterator typedefCGAL::Triangulation_2< class, class >
all_vertices_begin() constCGAL::Triangulation_2< class, class >
all_vertices_end() constCGAL::Triangulation_2< class, class >
All_vertices_iterator typedefCGAL::Triangulation_2< class, class >
ccw(int i) constCGAL::Triangulation_2< class, class >
Circle typedefCGAL::Point_set_2< Gt, Tds >
circumcenter(Face_handle f) constCGAL::Triangulation_2< class, class >
clear()CGAL::Triangulation_2< class, class >
cw(int i) constCGAL::Triangulation_2< class, class >
Delaunay_triangulation_2(const Traits &gt=Traits())CGAL::Delaunay_triangulation_2< Gt, Tds >
Delaunay_triangulation_2(const Delaunay_triangulation_2< Traits, Tds > &tr)CGAL::Delaunay_triangulation_2< Gt, Tds >
difference_type typedefCGAL::Triangulation_2< class, class >
dimension() constCGAL::Triangulation_2< class, class >
draw_dual(Stream &ps)CGAL::Delaunay_triangulation_2< Gt, Tds >
dt(InputIterator first, InputIterator last, Traits gt=Traits())CGAL::Delaunay_triangulation_2< Gt, Tds >
dual(const Face_handle &f) constCGAL::Delaunay_triangulation_2< Gt, Tds >
dual(const Edge &e) constCGAL::Delaunay_triangulation_2< Gt, Tds >
dual(const Edge_circulator &ec) constCGAL::Delaunay_triangulation_2< Gt, Tds >
dual(const Edge_iterator &ei) constCGAL::Delaunay_triangulation_2< Gt, Tds >
Edge typedefCGAL::Point_set_2< Gt, Tds >
EDGECGAL::Triangulation_2< class, class >
Edge_circulator typedefCGAL::Triangulation_2< class, class >
Face typedefCGAL::Triangulation_2< class, class >
FACECGAL::Triangulation_2< class, class >
Face_circulator typedefCGAL::Triangulation_2< class, class >
Face_handle typedefCGAL::Triangulation_2< class, class >
finite_edges_begin() constCGAL::Triangulation_2< class, class >
finite_edges_end() constCGAL::Triangulation_2< class, class >
Finite_edges_iterator typedefCGAL::Triangulation_2< class, class >
finite_faces_begin() constCGAL::Triangulation_2< class, class >
finite_faces_end() constCGAL::Triangulation_2< class, class >
Finite_faces_iterator typedefCGAL::Triangulation_2< class, class >
finite_vertex() constCGAL::Triangulation_2< class, class >
finite_vertices_begin() constCGAL::Triangulation_2< class, class >
finite_vertices_end() constCGAL::Triangulation_2< class, class >
Finite_vertices_iterator typedefCGAL::Triangulation_2< class, class >
flip(Face_handle f, int i)CGAL::Triangulation_2< class, class >
geom_traits() constCGAL::Triangulation_2< class, class >
Geom_traits typedefCGAL::Triangulation_2< class, class >
get_boundary_of_conflicts(const Point &p, OutputItBoundaryEdges eit, Face_handle start) constCGAL::Delaunay_triangulation_2< Gt, Tds >
get_conflicts(const Point &p, OutputItFaces fit, Face_handle start) constCGAL::Delaunay_triangulation_2< Gt, Tds >
get_conflicts_and_boundary(const Point &p, OutputItFaces fit, OutputItBoundaryEdges eit, Face_handle start) constCGAL::Delaunay_triangulation_2< Gt, Tds >
incident_edges(Vertex_handle v) constCGAL::Triangulation_2< class, class >
incident_edges(Vertex_handle v, Face_handle f) constCGAL::Triangulation_2< class, class >
incident_faces(Vertex_handle v) constCGAL::Triangulation_2< class, class >
incident_faces(Vertex_handle v, Face_handle f) constCGAL::Triangulation_2< class, class >
incident_vertices(Vertex_handle v) constCGAL::Triangulation_2< class, class >
incident_vertices(Vertex_handle v, Face_handle f)CGAL::Triangulation_2< class, class >
includes_edge(Vertex_handle va, Vertex_handle vb, Vertex_handle &vbr, Face_handle &fr, int &i)CGAL::Triangulation_2< class, class >
inexact_locate(const Point &query, Face_handle start=Face_handle()) constCGAL::Triangulation_2< class, class >
infinite_face() constCGAL::Triangulation_2< class, class >
infinite_vertex() constCGAL::Triangulation_2< class, class >
insert(const Point &p, Face_handle f=Face_handle())CGAL::Delaunay_triangulation_2< Gt, Tds >
insert(const Point &p, Locate_type &lt, Face_handle loc, int li)CGAL::Delaunay_triangulation_2< Gt, Tds >
insert(PointInputIterator first, PointInputIterator last)CGAL::Delaunay_triangulation_2< Gt, Tds >
insert(PointWithInfoInputIterator first, PointWithInfoInputIterator last)CGAL::Delaunay_triangulation_2< Gt, Tds >
CGAL::Triangulation_2::insert(const Point &p, Locate_type lt, Face_handle loc, int li)CGAL::Triangulation_2< class, class >
CGAL::Triangulation_2::insert(InputIterator first, InputIterator last)CGAL::Triangulation_2< class, class >
insert_first(const Point &p)CGAL::Triangulation_2< class, class >
insert_in_edge(const Point &p, Face_handle f, int i)CGAL::Triangulation_2< class, class >
insert_in_face(const Point &p, Face_handle f)CGAL::Triangulation_2< class, class >
insert_outside_affine_hull(const Point &p)CGAL::Triangulation_2< class, class >
insert_outside_convex_hull(const Point &p, Face_handle f)CGAL::Triangulation_2< class, class >
insert_second(const Point &p)CGAL::Triangulation_2< class, class >
is_edge(Vertex_handle va, Vertex_handle vb)CGAL::Triangulation_2< class, class >
is_edge(Vertex_handle va, Vertex_handle vb, Face_handle &fr, int &i)CGAL::Triangulation_2< class, class >
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3)CGAL::Triangulation_2< class, class >
is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle &fr)CGAL::Triangulation_2< class, class >
is_infinite(Vertex_handle v) constCGAL::Triangulation_2< class, class >
is_infinite(Face_handle f) constCGAL::Triangulation_2< class, class >
is_infinite(Face_handle f, int i) constCGAL::Triangulation_2< class, class >
is_infinite(Edge e) constCGAL::Triangulation_2< class, class >
is_infinite(Edge_circulator ec) constCGAL::Triangulation_2< class, class >
is_infinite(All_edges_iterator ei) constCGAL::Triangulation_2< class, class >
is_valid(bool verbose=false, int level=0) constCGAL::Delaunay_triangulation_2< Gt, Tds >
Line_face_circulator typedefCGAL::Triangulation_2< class, class >
line_walk(const Point &p, const Point &q, Face_handle f=Face_handle()) constCGAL::Triangulation_2< class, class >
locate(const Point &query, Face_handle f=Face_handle()) constCGAL::Triangulation_2< class, class >
locate(const Point &query, Locate_type &lt, int &li, Face_handle h=Face_handle()) constCGAL::Triangulation_2< class, class >
Locate_type enum nameCGAL::Triangulation_2< class, class >
lookup(Point p)CGAL::Point_set_2< Gt, Tds >
mirror_edge(Edge e) constCGAL::Triangulation_2< class, class >
mirror_index(Face_handle f, int i) constCGAL::Triangulation_2< class, class >
mirror_vertex(Face_handle f, int i) constCGAL::Triangulation_2< class, class >
move(Vertex_handle v, const Point &p)CGAL::Delaunay_triangulation_2< Gt, Tds >
move_if_no_collision(Vertex_handle v, const Point &p)CGAL::Delaunay_triangulation_2< Gt, Tds >
nearest_neighbor(Point p)CGAL::Point_set_2< Gt, Tds >
nearest_neighbor(Vertex_handle v)CGAL::Point_set_2< Gt, Tds >
nearest_neighbors(Point p, size_type k, OutputIterator res)CGAL::Point_set_2< Gt, Tds >
nearest_neighbors(Vertex_handle v, size_type k, OutputIterator res)CGAL::Point_set_2< Gt, Tds >
nearest_vertex(const Point &p, Face_handle f=Face_handle()) constCGAL::Delaunay_triangulation_2< Gt, Tds >
Numb_type typedefCGAL::Point_set_2< Gt, Tds >
number_of_faces() constCGAL::Triangulation_2< class, class >
number_of_vertices() constCGAL::Triangulation_2< class, class >
operator<<(ostream &os, const Triangulation_2< Traits, Tds > &T)CGAL::Triangulation_2< class, class >
operator=(const Triangulation_2< Traits, Tds > &tr)CGAL::Triangulation_2< class, class >
operator>>(istream &is, const Triangulation_2< Traits, Tds > &T)CGAL::Triangulation_2< class, class >
oriented_side(Face_handle f, const Point &p) constCGAL::Triangulation_2< class, class >
OUTSIDE_AFFINE_HULLCGAL::Triangulation_2< class, class >
OUTSIDE_CONVEX_HULLCGAL::Triangulation_2< class, class >
Point typedefCGAL::Point_set_2< Gt, Tds >
Point_iterator typedefCGAL::Triangulation_2< class, class >
Point_set_2()CGAL::Point_set_2< Gt, Tds >
Point_set_2(InputIterator first, InputIterator last)CGAL::Point_set_2< Gt, Tds >
points_begin() constCGAL::Triangulation_2< class, class >
points_end() constCGAL::Triangulation_2< class, class >
push_back(const Point &p)CGAL::Delaunay_triangulation_2< Gt, Tds >
range_search(const Circle &C, OutputIterator res)CGAL::Point_set_2< Gt, Tds >
range_search(const Point &a, const Point &b, const Point &c, OutputIterator res)CGAL::Point_set_2< Gt, Tds >
range_search(const Point &a1, const Point &b1, const Point &c1, const Point &d1, OutputIterator res)CGAL::Point_set_2< Gt, Tds >
remove(Vertex_handle v)CGAL::Delaunay_triangulation_2< Gt, Tds >
remove_degree_3(Vertex_handle v)CGAL::Triangulation_2< class, class >
remove_first(Vertex_handle v)CGAL::Triangulation_2< class, class >
remove_second(Vertex_handle v)CGAL::Triangulation_2< class, class >
Segment typedefCGAL::Point_set_2< Gt, Tds >
segment(Face_handle f, int i) constCGAL::Triangulation_2< class, class >
segment(const Edge &e) constCGAL::Triangulation_2< class, class >
segment(const Edge_circulator &ec) constCGAL::Triangulation_2< class, class >
segment(const Edge_iterator &ei) constCGAL::Triangulation_2< class, class >
set_infinite_vertex(const Vertex_handle &v)CGAL::Triangulation_2< class, class >
side_of_oriented_circle(Face_handle f, const Point &p) constCGAL::Delaunay_triangulation_2< Gt, Tds >
CGAL::Triangulation_2::side_of_oriented_circle(Face_handle f, const Point &p)CGAL::Triangulation_2< class, class >
size_type typedefCGAL::Point_set_2< Gt, Tds >
star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end)CGAL::Triangulation_2< class, class >
star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end)CGAL::Triangulation_2< class, class >
swap(Triangulation_2 &tr)CGAL::Triangulation_2< class, class >
tds() constCGAL::Triangulation_2< class, class >
tds()CGAL::Triangulation_2< class, class >
triangle(Face_handle f) constCGAL::Triangulation_2< class, class >
Triangle typedefCGAL::Triangulation_2< class, class >
Triangulation typedefCGAL::Point_set_2< Gt, Tds >
Triangulation_2(const Traits &gt=Traits())CGAL::Triangulation_2< class, class >
Triangulation_2(const Triangulation_2 &tr)CGAL::Triangulation_2< class, class >
Triangulation_cw_ccw_2()CGAL::Triangulation_cw_ccw_2
Triangulation_data_structure typedefCGAL::Triangulation_2< class, class >
Vertex typedefCGAL::Point_set_2< Gt, Tds >
VERTEXCGAL::Triangulation_2< class, class >
Vertex_circulator typedefCGAL::Triangulation_2< class, class >
Vertex_handle typedefCGAL::Point_set_2< Gt, Tds >