\( \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.8.1 - 2D Apollonius Graphs (Delaunay Graphs of Disks)
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Apollonius_graph_hierarchy_2< Gt, Agds > Member List

This is the complete list of members for CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >, including all inherited members.

all_edges_begin()CGAL::Apollonius_graph_2< Gt, Agds >
all_edges_end()CGAL::Apollonius_graph_2< Gt, Agds >
All_edges_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
all_faces_begin()CGAL::Apollonius_graph_2< Gt, Agds >
all_faces_end()CGAL::Apollonius_graph_2< Gt, Agds >
All_faces_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
all_vertices_begin()CGAL::Apollonius_graph_2< Gt, Agds >
all_vertices_end()CGAL::Apollonius_graph_2< Gt, Agds >
All_vertices_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
Apollonius_graph_2(Gt gt=Gt())CGAL::Apollonius_graph_2< Gt, Agds >
Apollonius_graph_2(Input_iterator first, Input_iterator beyond, Gt gt=Gt())CGAL::Apollonius_graph_2< Gt, Agds >
Apollonius_graph_2(const Apollonius_graph_2< Gt, Agds > &other)CGAL::Apollonius_graph_2< Gt, Agds >
Apollonius_graph_hierarchy_2(Gt gt=Gt())CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
Apollonius_graph_hierarchy_2(Input_iterator first, Input_iterator beyond, Gt gt=Gt())CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
Apollonius_graph_hierarchy_2(Apollonius_graph_hierarchy_2< Gt, Agds > other)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
clear()CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
data_structure()CGAL::Apollonius_graph_2< Gt, Agds >
Data_structure typedefCGAL::Apollonius_graph_2< Gt, Agds >
dimension()CGAL::Apollonius_graph_2< Gt, Agds >
draw_dual(Stream &str)CGAL::Apollonius_graph_2< Gt, Agds >
draw_dual_edge(Edge e, Stream &str)CGAL::Apollonius_graph_2< Gt, Agds >
draw_primal(Stream &str)CGAL::Apollonius_graph_2< Gt, Agds >
draw_primal_edge(Edge e, Stream &str)CGAL::Apollonius_graph_2< Gt, Agds >
dual(Face_handle f) const CGAL::Apollonius_graph_2< Gt, Agds >
dual(All_faces_iterator it) const CGAL::Apollonius_graph_2< Gt, Agds >
dual(Finite_faces_iterator it) const CGAL::Apollonius_graph_2< Gt, Agds >
Edge typedefCGAL::Apollonius_graph_2< Gt, Agds >
Edge_circulator typedefCGAL::Apollonius_graph_2< Gt, Agds >
Face typedefCGAL::Apollonius_graph_2< Gt, Agds >
Face_circulator typedefCGAL::Apollonius_graph_2< Gt, Agds >
Face_handle typedefCGAL::Apollonius_graph_2< Gt, Agds >
file_input(std::istream &is)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
file_output(std::ostream &os)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
finite_edges_begin()CGAL::Apollonius_graph_2< Gt, Agds >
finite_edges_end()CGAL::Apollonius_graph_2< Gt, Agds >
Finite_edges_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
finite_faces_begin()CGAL::Apollonius_graph_2< Gt, Agds >
finite_faces_end() const CGAL::Apollonius_graph_2< Gt, Agds >
Finite_faces_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
finite_vertex()CGAL::Apollonius_graph_2< Gt, Agds >
finite_vertices_begin()CGAL::Apollonius_graph_2< Gt, Agds >
finite_vertices_end()CGAL::Apollonius_graph_2< Gt, Agds >
Finite_vertices_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
geom_traits()CGAL::Apollonius_graph_2< Gt, Agds >
Geom_traits typedefCGAL::Apollonius_graph_2< Gt, Agds >
hidden_sites_begin()CGAL::Apollonius_graph_2< Gt, Agds >
hidden_sites_end()CGAL::Apollonius_graph_2< Gt, Agds >
Hidden_sites_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
incident_edges(Vertex_handle v)CGAL::Apollonius_graph_2< Gt, Agds >
incident_edges(Vertex_handle v, Face_handle f)CGAL::Apollonius_graph_2< Gt, Agds >
incident_faces(Vertex_handle v)CGAL::Apollonius_graph_2< Gt, Agds >
incident_faces(Vertex_handle v, Face_handle f)CGAL::Apollonius_graph_2< Gt, Agds >
incident_vertices(Vertex_handle v)CGAL::Apollonius_graph_2< Gt, Agds >
incident_vertices(Vertex_handle v, Face_handle f)CGAL::Apollonius_graph_2< Gt, Agds >
infinite_face()CGAL::Apollonius_graph_2< Gt, Agds >
infinite_vertex()CGAL::Apollonius_graph_2< Gt, Agds >
insert(Input_iterator first, Input_iterator beyond)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
insert(Site_2 s)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
insert(Site_2 s, Vertex_handle vnear)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
is_infinite(Vertex_handle v) const CGAL::Apollonius_graph_2< Gt, Agds >
is_infinite(Face_handle f) const CGAL::Apollonius_graph_2< Gt, Agds >
is_infinite(Face_handle f, int i) const CGAL::Apollonius_graph_2< Gt, Agds >
is_infinite(Edge e) const CGAL::Apollonius_graph_2< Gt, Agds >
is_infinite(Edge_circulator ec) const CGAL::Apollonius_graph_2< Gt, Agds >
is_valid(bool verbose=false, int level=1) const CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::is_valid(bool verbose=false, int level=1)CGAL::Apollonius_graph_2< Gt, Agds >
nearest_neighbor(Point p)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
nearest_neighbor(Point p, Vertex_handle vnear)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::nearest_neighbor(Point_2 p)CGAL::Apollonius_graph_2< Gt, Agds >
CGAL::Apollonius_graph_2::nearest_neighbor(Point_2 p, Vertex_handle vnear)CGAL::Apollonius_graph_2< Gt, Agds >
number_of_faces()CGAL::Apollonius_graph_2< Gt, Agds >
number_of_hidden_sites()CGAL::Apollonius_graph_2< Gt, Agds >
number_of_vertices()CGAL::Apollonius_graph_2< Gt, Agds >
number_of_visible_sites()CGAL::Apollonius_graph_2< Gt, Agds >
operator<<(std::ostream &os, Apollonius_graph_hierarchy_2< Gt, Agds > agh)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::operator<<(std::ostream &os, Apollonius_graph_2< Gt, Agds > ag)CGAL::Apollonius_graph_2< Gt, Agds >
operator=(Apollonius_graph_hierarchy_2< Gt, Agds > other)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::operator=(const Apollonius_graph_2< Gt, Agds > &other)CGAL::Apollonius_graph_2< Gt, Agds >
operator>>(std::istream &is, Apollonius_graph_hierarchy_2< Gt, Agds > agh)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::operator>>(std::istream &is, Apollonius_graph_2< Gt, Agds > ag)CGAL::Apollonius_graph_2< Gt, Agds >
Point_2 typedefCGAL::Apollonius_graph_2< Gt, Agds >
remove(Vertex_handle v)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
Site_2 typedefCGAL::Apollonius_graph_2< Gt, Agds >
sites_begin()CGAL::Apollonius_graph_2< Gt, Agds >
sites_end()CGAL::Apollonius_graph_2< Gt, Agds >
Sites_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >
size_type typedefCGAL::Apollonius_graph_2< Gt, Agds >
swap(Apollonius_graph_hierarchy_2< Gt, Agds > other)CGAL::Apollonius_graph_hierarchy_2< Gt, Agds >
CGAL::Apollonius_graph_2::swap(Apollonius_graph_2< Gt, Agds > other)CGAL::Apollonius_graph_2< Gt, Agds >
tds()CGAL::Apollonius_graph_2< Gt, Agds >
Triangulation_data_structure typedefCGAL::Apollonius_graph_2< Gt, Agds >
Vertex typedefCGAL::Apollonius_graph_2< Gt, Agds >
Vertex_circulator typedefCGAL::Apollonius_graph_2< Gt, Agds >
Vertex_handle typedefCGAL::Apollonius_graph_2< Gt, Agds >
visible_sites_begin()CGAL::Apollonius_graph_2< Gt, Agds >
visible_sites_end()CGAL::Apollonius_graph_2< Gt, Agds >
Visible_sites_iterator typedefCGAL::Apollonius_graph_2< Gt, Agds >