CGAL 6.2 - 3D Triangulations: Member List

CGAL 6.2 - 3D Triangulations

Loading...
Searching...
No Matches
CGAL::Regular_triangulation_3< Traits, TDS, SLDS > Member List

This is the complete list of members for CGAL::Regular_triangulation_3< Traits, TDS, SLDS >, including all inherited members.

adjacent_vertices(Vertex_handle v, OutputIterator vertices) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_cell_handles typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_cell_handles() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_cells_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_cells_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_cells_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_edges() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_edges typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_edges_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_edges_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_edges_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_facets() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_facets typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_facets_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_facets_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_facets_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_vertex_handles typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_vertex_handles() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_vertices_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
all_vertices_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
All_vertices_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
are_equal(Cell_handle c, int i, Cell_handle n, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
are_equal(const Facet &f, const Facet &g) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
are_equal(const Facet &f, Cell_handle n, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Bare_point typedef | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
ccw(unsigned int i) | CGAL::Triangulation_utils_3 | static
CELL enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Cell typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Cell_circulator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Cell_handle typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
clear() | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Concurrency_tag typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
cw(unsigned int i) | CGAL::Triangulation_utils_3 | static
degree(Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
difference_type typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
dimension() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
draw_dual(Stream &os) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
dual(Cell_handle c) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
dual(Facet f) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
dual(Cell_handle c, int i) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Edge typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
EDGE enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
FACET enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Facet typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Facet_circulator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
file_input(std::istream &is, ConvertVertex convert_vertex=ConvertVertex(), ConvertCell convert_cell=ConvertCell()) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
find_conflicts(const Weighted_point p, Cell_handle c, OutputIteratorBoundaryFacets bfit, OutputIteratorCells cit, OutputIteratorInternalFacets ifit, bool *could_lock_zone=nullptr, const Facet *this_facet_must_be_in_the_cz=nullptr, bool *the_facet_is_in_its_cz=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
finite_adjacent_vertices(Vertex_handle v, OutputIterator vertices) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_cell_handles() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_cell_handles typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_cells_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_cells_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_cells_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_edges() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_edges typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_edges_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_edges_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_edges_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_facets() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_facets typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_facets_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_facets_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_facets_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_incident_cells(Vertex_handle v, OutputIterator cells) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_incident_edges(Vertex_handle v, OutputIterator edges) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_incident_facets(Vertex_handle v, OutputIterator facets) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_vertex_handles() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_vertex_handles typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_vertices_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
finite_vertices_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Finite_vertices_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip(Edge e) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip(Cell_handle c, int i, int j) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip(Facet f) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip(Cell_handle c, int i) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip_flippable(Edge e) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip_flippable(Cell_handle c, int i, int j) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip_flippable(Facet f) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
flip_flippable(Cell_handle c, int i) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Geom_traits typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
geom_traits() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
has_vertex(const Facet &f, Vertex_handle v, int &j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
has_vertex(Cell_handle c, int i, Vertex_handle v, int &j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
has_vertex(const Facet &f, Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
has_vertex(Cell_handle c, int i, Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_cells(Edge e) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_cells(Cell_handle c, int i, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_cells(Edge e, Cell_handle start) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_cells(Cell_handle c, int i, int j, Cell_handle start) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_cells(Vertex_handle v, OutputIterator cells) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_edges(Vertex_handle v, OutputIterator edges) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Edge e) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Cell_handle c, int i, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Edge e, Facet start) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Edge e, Cell_handle start, int f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Cell_handle c, int i, int j, Facet start) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Cell_handle c, int i, int j, Cell_handle start, int f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
incident_facets(Vertex_handle v, OutputIterator facets) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
inexact_locate(const Point &query, Cell_handle start=Cell_handle()) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
infinite_cell() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
infinite_vertex() | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert(const Weighted_point &p, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
insert(const Weighted_point &p, Vertex_handle hint, bool *could_lock_zone=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
insert(const Weighted_point &p, Locate_type lt, Cell_handle loc, int li, int lj, bool *could_lock_zone=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
insert(InputIterator first, InputIterator last) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
insert(WeightedPointWithInfoInputIterator first, WeightedPointWithInfoInputIterator last) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert(const Point &p, Cell_handle start=Cell_handle()) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert(const Point &p, Vertex_handle hint) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert(const Point &p, Locate_type lt, Cell_handle loc, int li, int lj) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert(PointInputIterator first, PointInputIterator last) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert(PointWithInfoInputIterator first, PointWithInfoInputIterator last) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_cell(const Point &p, Cell_handle c) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_edge(const Point &p, const Edge &e) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_edge(const Point &p, Cell_handle c, int i, int j) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_facet(const Point &p, const Facet &f) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_facet(const Point &p, Cell_handle c, int i) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_in_hole(const Weighted_point &p, CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
insert_in_hole(const Weighted_point &p, CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i, Vertex_handle newv) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert_in_hole(const Point &p, CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::insert_in_hole(const Point &p, CellIt cell_begin, CellIt cell_end, Cell_handle begin, int i, Vertex_handle newv) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_outside_affine_hull(const Point &p) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
insert_outside_convex_hull(const Point &p, Cell_handle c) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_cell(Cell_handle c) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_cell(Vertex_handle u, Vertex_handle v, Vertex_handle w, Vertex_handle x, Cell_handle &c, int &i, int &j, int &k, int &l) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_cell(Vertex_handle u, Vertex_handle v, Vertex_handle w, Vertex_handle x, Cell_handle &c) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_edge(Vertex_handle u, Vertex_handle v, Cell_handle &c, int &i, int &j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_facet(Vertex_handle u, Vertex_handle v, Vertex_handle w, Cell_handle &c, int &i, int &j, int &k) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_Gabriel(Cell_handle c, int i) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
is_Gabriel(Cell_handle c, int i, int j) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
is_Gabriel(const Facet &f) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
is_Gabriel(const Edge &e) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
is_Gabriel(Vertex_handle v) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
is_infinite(Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_infinite(Cell_handle c) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_infinite(Cell_handle c, int i) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_infinite(const Facet &f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_infinite(Cell_handle c, int i, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_infinite(const Edge &e) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_valid(bool verbose=false) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
CGAL::Triangulation_3::is_valid(Cell_handle c, bool verbose=false) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_vertex(const Point &p, Vertex_handle &v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
is_vertex(Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
locate(const Point &query, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
locate(const Point &query, Vertex_handle hint, bool *could_lock_zone=nullptr) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
locate(const Point &query, Locate_type &lt, int &li, int &lj, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
locate(const Point &query, Locate_type &lt, int &li, int &lj, Vertex_handle hint, bool *could_lock_zone=nullptr) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Locate_type enum name | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Lock_data_structure typedef | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
mirror_facet(Facet f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
mirror_index(Cell_handle c, int i) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
mirror_vertex(Cell_handle c, int i) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
nearest_power_vertex(const Bare_point &p, Cell_handle c=Cell_handle()) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
nearest_power_vertex_in_cell(const Bare_point &p, Cell_handle c) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
next_around_edge(unsigned int i, unsigned int j) | CGAL::Triangulation_utils_3 | static
number_of_cells() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_edges() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_facets() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_finite_cells() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_finite_edges() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_finite_facets() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
number_of_vertices() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
operator!=(const Triangulation_3< GT, Tds1 > &t1, const Triangulation_3< GT, Tds2 > &t2) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
operator<<(ostream &os, const Triangulation_3 &t) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
operator=(const Triangulation_3 &tr) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
operator==(const Triangulation_3< GT, Tds1 > &t1, const Triangulation_3< GT, Tds2 > &t2) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
operator>>(istream &is, Triangulation_3 &t) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
OUTSIDE_AFFINE_HULL enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
OUTSIDE_CONVEX_HULL enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Point typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
point(Cell_handle c, int i) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
point(Vertex_handle v) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Point_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Points typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
points() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
points_begin() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
points_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Regular_triangulation_3(const Traits &traits=Traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Regular_triangulation_3(const Regular_triangulation_3 &rt1) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Regular_triangulation_3(InputIterator first, InputIterator last, const Traits &traits=Traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Regular_triangulation_3(InputIterator first, InputIterator last, Lock_data_structure *lock_ds, const Traits &traits=Traits()) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
remove(Vertex_handle v) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
remove(Vertex_handle v, bool *could_lock_zone) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
remove(InputIterator first, InputIterator beyond) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Segment typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment(const Edge &e) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment(Cell_handle c, int i, int j) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Segment_cell_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Segment_simplex_iterator typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Segment_traverser_cell_handles typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_cell_handles() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_cells_begin(Vertex_handle vs, Vertex_handle vt) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_cells_begin(const Point &ps, const Point &pt, Cell_handle hint=Cell_handle()) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_cells_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Segment_traverser_simplices typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_simplices() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_simplices_begin(Vertex_handle vs, Vertex_handle vt) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_simplices_begin(const Point &ps, const Point &pt, Cell_handle hint=Cell_handle()) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
segment_traverser_simplices_end() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
set_infinite_vertex(Vertex_handle v) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
set_lock_data_structure(Lock_data_structure *lock_ds) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_cell(const Point &p, Cell_handle c, Locate_type &lt, int &li, int &lj) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_edge(const Point &p, const Edge &e, Locate_type &lt, int &li) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_edge(const Point &p, Cell_handle c, Locate_type &lt, int &li) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_facet(const Point &p, const Facet &f, Locate_type &lt, int &li, int &lj) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_facet(const Point &p, Cell_handle c, Locate_type &lt, int &li, int &lj) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
side_of_power_circle(const Facet &f, const Weighted_point &p) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
side_of_power_circle(Cell_handle c, int i, const Weighted_point &p) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
side_of_power_segment(Cell_handle c, const Weighted_point &p) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
side_of_power_sphere(Cell_handle c, const Weighted_point &p) const | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Simplex typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
size_type typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
swap(Triangulation_3 &tr) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
tds() const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
tds() | CGAL::Triangulation_3< Traits, TDS, SLDS > |
tetrahedron(Cell_handle c) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Tetrahedron typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangle typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
triangle(Cell_handle c, int i) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
triangle(const Facet &f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangulation_3(const Geom_traits &traits=Geom_traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangulation_3(Lock_data_structure *lock_ds=nullptr, const Geom_traits &traits=Geom_traits()) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangulation_3(const Triangulation_3 &tr) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangulation_3(InputIterator first, InputIterator last, const Geom_traits &traits=Geom_traits(), Lock_data_structure *lock_ds=nullptr) | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Triangulation_data_structure typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
try_lock_and_get_incident_cells(Vertex_handle v, std::vector< Cell_handle > &cells) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Vertex typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
VERTEX enum value | CGAL::Triangulation_3< Traits, TDS, SLDS > |
Vertex_handle typedef | CGAL::Triangulation_3< Traits, TDS, SLDS > |
vertex_triple_index(const int i, const int j) | CGAL::Triangulation_utils_3 | static
vertices(const Edge &e) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
vertices(const Facet &f) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
vertices(const Cell_handle c) const | CGAL::Triangulation_3< Traits, TDS, SLDS > |
vertices_in_conflict(const Weighted_point &p, Cell_handle c, OutputIterator res) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
vertices_inside_conflict_zone(const Weighted_point &p, Cell_handle c, OutputIterator res) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
vertices_on_conflict_zone_boundary(const Weighted_point &p, Cell_handle c, OutputIterator res) | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |
Weighted_point typedef | CGAL::Regular_triangulation_3< Traits, TDS, SLDS > |