\( \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 5.0 - 3D Triangulations
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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
All_cell_handles typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
all_cell_handles() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_cells_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_cells_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
All_cells_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
All_edges typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
all_edges() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_edges_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_edges_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
All_edges_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
All_facets typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
all_facets() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_facets_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_facets_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
All_facets_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
All_vertex_handles typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
all_vertex_handles() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_vertices_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
all_vertices_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
All_vertices_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
are_equal(Cell_handle c, int i, Cell_handle n, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
are_equal(const Facet &f, const Facet &g) constCGAL::Triangulation_3< Traits, TDS, SLDS >
are_equal(const Facet &f, Cell_handle n, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
Bare_point typedefCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
ccw(unsigned int i)CGAL::Triangulation_utils_3static
Cell typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
CELL enum valueCGAL::Triangulation_3< Traits, TDS, SLDS >
Cell_circulator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
Cell_handle typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
clear()CGAL::Triangulation_3< Traits, TDS, SLDS >
Concurrency_tag typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
cw(unsigned int i)CGAL::Triangulation_utils_3static
degree(Vertex_handle v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
difference_type typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
dimension() constCGAL::Triangulation_3< Traits, TDS, SLDS >
draw_dual(Stream &os)CGAL::Regular_triangulation_3< Traits, TDS, SLDS >
dual(Cell_handle c) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
dual(Facet f) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
dual(Cell_handle c, int i) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
EDGE enum valueCGAL::Triangulation_3< Traits, TDS, SLDS >
Edge typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
Facet typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
FACET enum valueCGAL::Triangulation_3< Traits, TDS, SLDS >
Facet_circulator typedefCGAL::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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_cell_handles() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_cell_handles typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_cells_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_cells_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_cells_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_edges() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_edges typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_edges_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_edges_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_edges_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_facets() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_facets typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_facets_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_facets_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_facets_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_incident_cells(Vertex_handle v, OutputIterator cells) constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_incident_edges(Vertex_handle v, OutputIterator edges) constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_incident_facets(Vertex_handle v, OutputIterator facets) constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_vertex_handles() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_vertex_handles typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_vertices_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
finite_vertices_end() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Finite_vertices_iterator typedefCGAL::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 typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
geom_traits() constCGAL::Triangulation_3< Traits, TDS, SLDS >
has_vertex(const Facet &f, Vertex_handle v, int &j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
has_vertex(Cell_handle c, int i, Vertex_handle v, int &j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
has_vertex(const Facet &f, Vertex_handle v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
has_vertex(Cell_handle c, int i, Vertex_handle v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_cells(Edge e) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_cells(Cell_handle c, int i, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_cells(Edge e, Cell_handle start) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_cells(Cell_handle c, int i, int j, Cell_handle start) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_cells(Vertex_handle v, OutputIterator cells) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_edges(Vertex_handle v, OutputIterator edges) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Edge e) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Cell_handle c, int i, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Edge e, Facet start) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Edge e, Cell_handle start, int f) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Cell_handle c, int i, int j, Facet start) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Cell_handle c, int i, int j, Cell_handle start, int f) constCGAL::Triangulation_3< Traits, TDS, SLDS >
incident_facets(Vertex_handle v, OutputIterator facets) constCGAL::Triangulation_3< Traits, TDS, SLDS >
inexact_locate(const Point &query, Cell_handle start=Cell_handle()) constCGAL::Triangulation_3< Traits, TDS, SLDS >
infinite_cell() constCGAL::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) constCGAL::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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_cell(Vertex_handle u, Vertex_handle v, Vertex_handle w, Vertex_handle x, Cell_handle &c) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_edge(Vertex_handle u, Vertex_handle v, Cell_handle &c, int &i, int &j) constCGAL::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) constCGAL::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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_infinite(Cell_handle c) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_infinite(Cell_handle c, int i) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_infinite(const Facet &f) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_infinite(Cell_handle c, int i, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_infinite(const Edge &e) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_valid(bool verbose=false) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
CGAL::Triangulation_3::is_valid(Cell_handle c, bool verbose=false) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_vertex(const Point &p, Vertex_handle &v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
is_vertex(Vertex_handle v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
locate(const Point &query, Cell_handle start=Cell_handle(), bool *could_lock_zone=nullptr) constCGAL::Triangulation_3< Traits, TDS, SLDS >
locate(const Point &query, Vertex_handle hint, bool *could_lock_zone=nullptr) constCGAL::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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
locate(const Point &query, Locate_type &lt, int &li, int &lj, Vertex_handle hint, bool *could_lock_zone=nullptr) constCGAL::Triangulation_3< Traits, TDS, SLDS >
Locate_type enum nameCGAL::Triangulation_3< Traits, TDS, SLDS >
Lock_data_structure typedefCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
mirror_facet(Facet f) constCGAL::Triangulation_3< Traits, TDS, SLDS >
mirror_index(Cell_handle c, int i) constCGAL::Triangulation_3< Traits, TDS, SLDS >
mirror_vertex(Cell_handle c, int i) constCGAL::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_3static
number_of_cells() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_edges() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_facets() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_finite_cells() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_finite_edges() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_finite_facets() constCGAL::Triangulation_3< Traits, TDS, SLDS >
number_of_vertices() constCGAL::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 valueCGAL::Triangulation_3< Traits, TDS, SLDS >
OUTSIDE_CONVEX_HULL enum valueCGAL::Triangulation_3< Traits, TDS, SLDS >
point(Cell_handle c, int i) constCGAL::Triangulation_3< Traits, TDS, SLDS >
point(Vertex_handle v) constCGAL::Triangulation_3< Traits, TDS, SLDS >
Point typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
Point_iterator typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
points() constCGAL::Triangulation_3< Traits, TDS, SLDS >
Points typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
points_begin() constCGAL::Triangulation_3< Traits, TDS, SLDS >
points_end() constCGAL::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(const Edge &e) constCGAL::Triangulation_3< Traits, TDS, SLDS >
segment(Cell_handle c, int i, int j) constCGAL::Triangulation_3< Traits, TDS, SLDS >
Segment typedefCGAL::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) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_cell(const Point &p, Cell_handle c, Locate_type &lt, int &li, int &lj) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_edge(const Point &p, const Edge &e, Locate_type &lt, int &li) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_edge(const Point &p, Cell_handle c, Locate_type &lt, int &li) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_facet(const Point &p, const Facet &f, Locate_type &lt, int &li, int &lj) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_facet(const Point &p, Cell_handle c, Locate_type &lt, int &li, int &lj) constCGAL::Triangulation_3< Traits, TDS, SLDS >
side_of_power_circle(const Facet &f, const Weighted_point &p) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
side_of_power_circle(Cell_handle c, int i, const Weighted_point &p) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
side_of_power_segment(Cell_handle c, const Weighted_point &p) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
side_of_power_sphere(Cell_handle c, const Weighted_point &p) constCGAL::Regular_triangulation_3< Traits, TDS, SLDS >
Simplex typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
size_type typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
swap(Triangulation_3 &tr)CGAL::Triangulation_3< Traits, TDS, SLDS >
tds() constCGAL::Triangulation_3< Traits, TDS, SLDS >
tds()CGAL::Triangulation_3< Traits, TDS, SLDS >
Tetrahedron typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
tetrahedron(Cell_handle c) constCGAL::Triangulation_3< Traits, TDS, SLDS >
triangle(Cell_handle c, int i) constCGAL::Triangulation_3< Traits, TDS, SLDS >
triangle(const Facet &f) constCGAL::Triangulation_3< Traits, TDS, SLDS >
Triangle typedefCGAL::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 typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
try_lock_and_get_incident_cells(Vertex_handle v, std::vector< Cell_handle > &cells) constCGAL::Triangulation_3< Traits, TDS, SLDS >
VERTEX enum valueCGAL::Triangulation_3< Traits, TDS, SLDS >
Vertex typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
Vertex_handle typedefCGAL::Triangulation_3< Traits, TDS, SLDS >
vertex_triple_index(const int i, const int j)CGAL::Triangulation_utils_3static
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 typedefCGAL::Regular_triangulation_3< Traits, TDS, SLDS >