\( \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.14 - dD Convex Hulls and Delaunay Triangulations
CGAL::Delaunay_d< R, Lifted_R > Member List

This is the complete list of members for CGAL::Delaunay_d< R, Lifted_R >, including all inherited members.

all_facets()CGAL::Convex_hull_d< Lifted_R >private
all_points()CGAL::Delaunay_d< R, Lifted_R >
all_simplices(Delaunay_voronoi_kind k=NEAREST)CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d< Lifted_R >::all_simplices()CGAL::Convex_hull_d< Lifted_R >private
all_vertices(Delaunay_voronoi_kind k=NEAREST)CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d< Lifted_R >::all_vertices()CGAL::Convex_hull_d< Lifted_R >private
associated_point(Vertex_handle v)CGAL::Delaunay_d< R, Lifted_R >
bounded_side(const Point_d &x)CGAL::Convex_hull_d< Lifted_R >private
clear()CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d< Lifted_R >::clear(int d)CGAL::Convex_hull_d< Lifted_R >private
contains(Simplex_handle s, const Point_d &x)CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d(int d, Lifted_R Kernel=Lifted_R())CGAL::Convex_hull_d< Lifted_R >private
convex_hull_d_to_polyhedron_3(const Convex_hull_d< Lifted_R > &C, Polyhedron_3< T, HDS > &P)CGAL::Convex_hull_d< Lifted_R >related
current_dimension()CGAL::Delaunay_d< R, Lifted_R >
d2_map(const Delaunay_d< R, Lifted_R > &D, GRAPH< typename Delaunay_d< R, Lifted_R >::Point_d, int > &DTG, typename Delaunay_d< R, Lifted_R >::Delaunay_voronoi_kind k=Delaunay_d< R, Lifted_R >::NEAREST)CGAL::Delaunay_d< R, Lifted_R >related
d3_surface_map(const Convex_hull_d< Lifted_R > &C, GRAPH< typename Convex_hull_d< Lifted_R >::Point_d, int > &G)CGAL::Convex_hull_d< Lifted_R >related
Delaunay_d(int d, R k1=R(), Lifted_R k2=Lifted_R())CGAL::Delaunay_d< R, Lifted_R >
Delaunay_voronoi_kind enum nameCGAL::Delaunay_d< R, Lifted_R >
dimension()CGAL::Delaunay_d< R, Lifted_R >
empty()CGAL::Delaunay_d< R, Lifted_R >
Facet_handle typedefCGAL::Convex_hull_d< Lifted_R >private
Facet_iterator typedefCGAL::Convex_hull_d< Lifted_R >private
facets_begin()CGAL::Convex_hull_d< Lifted_R >private
facets_end()CGAL::Convex_hull_d< Lifted_R >private
facets_visible_from(const Point_d &x)CGAL::Convex_hull_d< Lifted_R >private
FURTHEST enum valueCGAL::Delaunay_d< R, Lifted_R >
Hull_point_const_iterator typedefCGAL::Convex_hull_d< Lifted_R >private
hull_points_begin()CGAL::Convex_hull_d< Lifted_R >private
hull_points_end()CGAL::Convex_hull_d< Lifted_R >private
Hull_vertex_iterator typedefCGAL::Convex_hull_d< Lifted_R >private
hull_vertices_begin()CGAL::Convex_hull_d< Lifted_R >private
hull_vertices_end()CGAL::Convex_hull_d< Lifted_R >private
Hyperplane_d typedefCGAL::Convex_hull_d< Lifted_R >private
hyperplane_supporting(Facet_handle f)CGAL::Convex_hull_d< Lifted_R >private
index(Vertex_handle v)CGAL::Delaunay_d< R, Lifted_R >
index_of_vertex_in_opposite_facet(Facet_handle f, int i)CGAL::Convex_hull_d< Lifted_R >private
index_of_vertex_in_opposite_simplex(Simplex_handle s, int i)CGAL::Delaunay_d< R, Lifted_R >
insert(const Point_d &x)CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d< Lifted_R >::insert(Forward_iterator first, Forward_iterator last)CGAL::Convex_hull_d< Lifted_R >private
is_dimension_jump(const Point_d &x)CGAL::Convex_hull_d< Lifted_R >private
is_simplex_of_furthest(Simplex_handle s)CGAL::Delaunay_d< R, Lifted_R >
is_simplex_of_nearest(Simplex_handle s)CGAL::Delaunay_d< R, Lifted_R >
is_valid(bool throw_exceptions=false)CGAL::Convex_hull_d< Lifted_R >private
locate(const Point_d &x)CGAL::Delaunay_d< R, Lifted_R >
lookup(const Point_d &x)CGAL::Delaunay_d< R, Lifted_R >
NEAREST enum valueCGAL::Delaunay_d< R, Lifted_R >
nearest_neighbor(const Point_d &x)CGAL::Delaunay_d< R, Lifted_R >
number_of_facets()CGAL::Convex_hull_d< Lifted_R >private
number_of_simplices()CGAL::Convex_hull_d< Lifted_R >private
number_of_vertices()CGAL::Convex_hull_d< Lifted_R >private
opposite_facet(Facet_handle f, int i)CGAL::Convex_hull_d< Lifted_R >private
opposite_simplex(Simplex_handle s, int i)CGAL::Delaunay_d< R, Lifted_R >
Point_const_iterator typedefCGAL::Delaunay_d< R, Lifted_R >
Point_d typedefCGAL::Delaunay_d< R, Lifted_R >
point_of_facet(Facet_handle f, int i)CGAL::Convex_hull_d< Lifted_R >private
point_of_simplex(Simplex_handle s, int i)CGAL::Delaunay_d< R, Lifted_R >
points_begin()CGAL::Delaunay_d< R, Lifted_R >
points_end()CGAL::Delaunay_d< R, Lifted_R >
print_statistics()CGAL::Convex_hull_d< Lifted_R >private
R typedefCGAL::Convex_hull_d< Lifted_R >private
range_search(const Sphere_d &C)CGAL::Delaunay_d< R, Lifted_R >
range_search(const std::vector< Point_d > &A)CGAL::Delaunay_d< R, Lifted_R >
simplex(Vertex_handle v)CGAL::Delaunay_d< R, Lifted_R >
Simplex_handle typedefCGAL::Delaunay_d< R, Lifted_R >
Simplex_iterator typedefCGAL::Delaunay_d< R, Lifted_R >
simplices_begin(Delaunay_voronoi_kind k=NEAREST)CGAL::Delaunay_d< R, Lifted_R >
Convex_hull_d< Lifted_R >::simplices_begin()CGAL::Convex_hull_d< Lifted_R >private
simplices_end()CGAL::Delaunay_d< R, Lifted_R >
Sphere_d typedefCGAL::Delaunay_d< R, Lifted_R >
Vertex_handle typedefCGAL::Delaunay_d< R, Lifted_R >
Vertex_iterator typedefCGAL::Delaunay_d< R, Lifted_R >
vertex_of_facet(Facet_handle f, int i)CGAL::Convex_hull_d< Lifted_R >private
vertex_of_simplex(Simplex_handle s, int i)CGAL::Delaunay_d< R, Lifted_R >
vertices_begin()CGAL::Convex_hull_d< Lifted_R >private
vertices_end()CGAL::Convex_hull_d< Lifted_R >private
visit_all_facets(const Visitor &V)CGAL::Convex_hull_d< Lifted_R >private