\( \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.9 - 2D Range and Neighbor Search
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
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.

Circle typedefCGAL::Point_set_2< Gt, Tds >
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 >
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 >
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 >
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 >
is_valid(bool verbose=false, int level=0) constCGAL::Delaunay_triangulation_2< Gt, Tds >
lookup(Point p)CGAL::Point_set_2< Gt, Tds >
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 >
Point typedefCGAL::Point_set_2< Gt, Tds >
Point_set_2()CGAL::Point_set_2< Gt, Tds >
Point_set_2(InputIterator first, InputIterator last)CGAL::Point_set_2< Gt, Tds >
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 >
Segment typedefCGAL::Point_set_2< Gt, Tds >
side_of_oriented_circle(Face_handle f, const Point &p) constCGAL::Delaunay_triangulation_2< Gt, Tds >
size_type typedefCGAL::Point_set_2< Gt, Tds >
Triangulation typedefCGAL::Point_set_2< Gt, Tds >
Vertex typedefCGAL::Point_set_2< Gt, Tds >
Vertex_handle typedefCGAL::Point_set_2< Gt, Tds >