| All_edges typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_edges() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_edges_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_edges_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| All_edges_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| All_face_handles typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_face_handles() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_faces_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_faces_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| All_faces_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_vertex_handles() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| All_vertex_handles typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_vertices_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| all_vertices_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| All_vertices_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| ccw(int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Circle typedef | CGAL::Point_set_2< Gt, Tds > | |
| circumcenter(Face_handle f) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| clear() | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| cw(int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Delaunay_triangulation_2(const Traits >=Traits()) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| Delaunay_triangulation_2(const Delaunay_triangulation_2< Traits, Tds > &tr) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| Delaunay_triangulation_2(InputIterator first, InputIterator last, Traits gt=Traits()) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| difference_type typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| dimension() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| draw_dual(Stream &ps) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| dual(const Face_handle &f) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| dual(const Edge &e) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| dual(const Edge_circulator &ec) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| dual(const Edge_iterator &ei) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| EDGE | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Edge typedef | CGAL::Point_set_2< Gt, Tds > | |
| Edge_circulator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Face typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| FACE | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Face_circulator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Face_handle typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_edges typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_edges() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_edges_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_edges_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_edges_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_face_handles() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_face_handles typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_faces_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_faces_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_faces_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_vertex() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_vertex_handles typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_vertex_handles() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_vertices_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| finite_vertices_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Finite_vertices_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| flip(Face_handle f, int i) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Geom_traits typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| geom_traits() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| get_boundary_of_conflicts(const Point &p, OutputItBoundaryEdges eit, Face_handle start=Face_handle()) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| get_conflicts(const Point &p, OutputItFaces fit, Face_handle start=Face_handle()) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| get_conflicts_and_boundary(const Point &p, OutputItFaces fit, OutputItBoundaryEdges eit, Face_handle start=Face_handle()) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| incident_edges(Vertex_handle v) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| incident_edges(Vertex_handle v, Face_handle f) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| incident_faces(Vertex_handle v) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| incident_faces(Vertex_handle v, Face_handle f) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| incident_vertices(Vertex_handle v) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| incident_vertices(Vertex_handle v, Face_handle f) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| includes_edge(Vertex_handle va, Vertex_handle vb, Vertex_handle &vbb, Face_handle &fr, int &i) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| inexact_locate(const Point &query, Face_handle start=Face_handle()) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| infinite_face() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| infinite_vertex() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert(const Point &p, Face_handle f=Face_handle()) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| insert(const Point &p, Locate_type <, Face_handle loc, int li) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| insert(PointInputIterator first, PointInputIterator last) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| insert(PointWithInfoInputIterator first, PointWithInfoInputIterator last) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| CGAL::Triangulation_2::insert(const Point &p, Locate_type lt, Face_handle loc, int li) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_first(const Point &p) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_in_edge(const Point &p, Face_handle f, int i) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_in_face(const Point &p, Face_handle f) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_outside_affine_hull(const Point &p) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_outside_convex_hull(const Point &p, Face_handle f) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| insert_second(const Point &p) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_edge(Vertex_handle va, Vertex_handle vb) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_edge(Vertex_handle va, Vertex_handle vb, Face_handle &fr, int &i) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_face(Vertex_handle v1, Vertex_handle v2, Vertex_handle v3, Face_handle &fr) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(Vertex_handle v) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(Face_handle f) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(Face_handle f, int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(Edge e) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(Edge_circulator ec) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_infinite(All_edges_iterator ei) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| is_valid(bool verbose=false, int level=0) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| Line_face_circulator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| line_walk(const Point &p, const Point &q, Face_handle f=Face_handle()) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| locate(const Point &query, Face_handle f=Face_handle()) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| locate(const Point &query, Locate_type <, int &li, Face_handle h=Face_handle()) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Locate_type enum name | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| lookup(Point p) | CGAL::Point_set_2< Gt, Tds > | |
| mirror_edge(Edge e) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| mirror_index(Face_handle f, int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| mirror_vertex(Face_handle f, int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| move(Vertex_handle v, const Point &p) | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| move_if_no_collision(Vertex_handle v, const Point &p) | CGAL::Delaunay_triangulation_2< typename Traits, typename 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()) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| Numb_type typedef | CGAL::Point_set_2< Gt, Tds > | |
| number_of_faces() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| number_of_vertices() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| operator<<(ostream &os, const Triangulation_2< Traits, Tds > &T) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| operator=(const Triangulation_2< Traits, Tds > &tr) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| operator>>(istream &is, const Triangulation_2< Traits, Tds > &T) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| oriented_side(Face_handle f, const Point &p) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| OUTSIDE_AFFINE_HULL | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| OUTSIDE_CONVEX_HULL | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Point typedef | CGAL::Point_set_2< Gt, Tds > | |
| Point_iterator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Point_set_2() | CGAL::Point_set_2< Gt, Tds > | |
| Point_set_2(InputIterator first, InputIterator last) | CGAL::Point_set_2< Gt, Tds > | |
| points() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Points typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| points_begin() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| points_end() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| push_back(const Point &p) | CGAL::Delaunay_triangulation_2< typename Traits, typename 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< typename Traits, typename Tds > | |
| remove_degree_3(Vertex_handle v) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| remove_first(Vertex_handle v) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| remove_second(Vertex_handle v) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| segment(Face_handle f, int i) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| segment(const Edge &e) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| segment(const Edge_circulator &ec) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| segment(const Edge_iterator &ei) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Segment typedef | CGAL::Point_set_2< Gt, Tds > | |
| set_infinite_vertex(const Vertex_handle &v) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| side_of_oriented_circle(Face_handle f, const Point &p) const | CGAL::Delaunay_triangulation_2< typename Traits, typename Tds > | |
| CGAL::Triangulation_2::side_of_oriented_circle(Face_handle f, const Point &p) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| size_type typedef | CGAL::Point_set_2< Gt, Tds > | |
| star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| star_hole(Point p, EdgeIt edge_begin, EdgeIt edge_end, FaceIt face_begin, FaceIt face_end) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| swap(Triangulation_2 &tr) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| tds() const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| tds() | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Triangle typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| triangle(Face_handle f) const | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Triangulation typedef | CGAL::Point_set_2< Gt, Tds > | |
| Triangulation_2(const Traits >=Traits()) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Triangulation_2(const Triangulation_2 &tr) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Triangulation_2(InputIterator first, InputIterator last, const Traits >=Traits()) | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Triangulation_cw_ccw_2() | CGAL::Triangulation_cw_ccw_2 | |
| Triangulation_data_structure typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| VERTEX | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Vertex typedef | CGAL::Point_set_2< Gt, Tds > | |
| Vertex_circulator typedef | CGAL::Triangulation_2< typename Traits, typename Tds > | |
| Vertex_handle typedef | CGAL::Point_set_2< Gt, Tds > | |