| ccw(unsigned int i) | CGAL::Triangulation_utils_3 | static |
| cw(unsigned int i) | CGAL::Triangulation_utils_3 | static |
| Delaunay_triangulation_3(const Geom_traits &traits=Geom_traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Delaunay_triangulation_3(const Delaunay_triangulation_3 &dt1) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Delaunay_triangulation_3(InputIterator first, InputIterator last, const Geom_traits &traits=Geom_traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Delaunay_triangulation_3(InputIterator first, InputIterator last, Lock_data_structure *lock_ds, const Geom_traits &traits=Geom_traits()) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| draw_dual(Stream &os) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| dual(Cell_handle c) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| dual(Facet f) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| dual(Cell_handle c, int i) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| dual_support(Cell_handle c, int i) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| find_conflicts(const Point &p, Cell_handle c, OutputIteratorBoundaryFacets bfit, OutputIteratorCells cit, bool *could_lock_zone=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| find_conflicts(const Point &p, Cell_handle c, OutputIteratorBoundaryFacets bfit, OutputIteratorCells cit, OutputIteratorInternalFacets ifit, bool *could_lock_zone=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Geom_traits typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| insert(const Point &p, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| insert(const Point &p, Vertex_handle hint, bool *could_lock_zone=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| insert(const Point &p, Locate_type lt, Cell_handle loc, int li, int lj, bool *could_lock_zone=nullptr) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| insert(PointInputIterator first, PointInputIterator last) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| insert(PointWithInfoInputIterator first, PointWithInfoInputIterator last) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_Gabriel(Cell_handle c, int i) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_Gabriel(Cell_handle c, int i, int j) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_Gabriel(const Facet &f) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_Gabriel(const Edge &e) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_valid(bool verbose=false) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| is_valid(Cell_handle c, bool verbose=false) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Line typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Location_policy typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Lock_data_structure typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| move(Vertex_handle v, const Point &p) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| move_if_no_collision(Vertex_handle v, const Point &p) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| nearest_vertex(const Point &p, Cell_handle c=Cell_handle()) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| nearest_vertex_in_cell(const Point &p, Cell_handle c) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| next_around_edge(unsigned int i, unsigned int j) | CGAL::Triangulation_utils_3 | static |
| Object typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Plane typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Ray typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| remove(Vertex_handle v) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| remove(Vertex_handle v, bool *could_lock_zone) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| remove(InputIterator first, InputIterator beyond) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| remove_cluster(InputIterator first, InputIterator beyond) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| side_of_circle(const Facet &f, const Point &p) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| side_of_circle(Cell_handle c, int i, const Point &p) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| side_of_sphere(Cell_handle c, const Point &p) const | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| Triangulation_data_structure typedef | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| vertex_triple_index(const int i, const int j) | CGAL::Triangulation_utils_3 | static |
| vertices_in_conflict(const Point &p, Cell_handle c, OutputIterator res) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
| vertices_on_conflict_zone_boundary(const Point &p, Cell_handle c, OutputIterator res) | CGAL::Delaunay_triangulation_3< Traits, TDS, LP, SLDS > | |
1.8.13