\( \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 - 2D Apollonius Graphs (Delaunay Graphs of Disks)

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2]

CGAL |
Apollonius_graph_2 | The class `Apollonius_graph_2` represents the Apollonius graph
Apollonius_graph_filtered_traits_2 | The class `Apollonius_graph_filtered_traits_2` provides a model for the `ApolloniusGraphTraits_2` concept
Apollonius_graph_hierarchy_2 | We provide an alternative to the class `Apollonius_graph_2<Gt,Agds>` for the dynamic construction of the Apollonius graph
Apollonius_graph_hierarchy_vertex_base_2 | The class `Apollonius_graph_hierarchy_vertex_base_2` provides a model for the `ApolloniusGraphHierarchyVertexBase_2` concept, which is the vertex base required by the `Apollonius_graph_hierarchy_2<Gt,Agds>` class
Apollonius_graph_traits_2 | The class `Apollonius_graph_traits_2` provides a model for the `ApolloniusGraphTraits_2` concept
Apollonius_graph_vertex_base_2 | The class `Apollonius_graph_vertex_base_2` provides a model for the `ApolloniusGraphVertexBase_2` concept which is the vertex base required by the `ApolloniusGraphDataStructure_2` concept
Apollonius_site_2 | The class `Apollonius_site_2` is a model for the concept `ApolloniusSite_2`
ApolloniusGraphDataStructure_2 | The concept `ApolloniusGraphDataStructure_2` refines the concept `TriangulationDataStructure_2`. In addition it provides two methods for the insertion and removal of a degree 2 vertex in the data structure. The insertion method adds a new vertex to the specified edge, thus creating two new edges. Moreover, it creates two new faces that have the two newly created edges in common (see figure below). The removal method performs the reverse operation
ApolloniusGraphHierarchyVertexBase_2 | The vertex of an Apollonius graph included in an Apollonius graph hierarchy has to provide some pointers to the corresponding vertices in the graphs of the next and preceding levels. Therefore, the concept `ApolloniusGraphHierarchyVertexBase_2` refines the concept `ApolloniusGraphVertexBase_2`, by adding two vertex handles to the corresponding vertices for the next and previous level graphs
ApolloniusGraphTraits_2 | The concept `ApolloniusGraphTraits_2` provides the traits requirements for the `Apollonius_graph_2` class. In particular, it provides a type `Site_2`, which must be a model of the concept `ApolloniusSite_2`. It also provides constructions for sites and several function object types for the predicates
ApolloniusGraphVertexBase_2 | The concept `ApolloniusGraphVertexBase_2` describes the requirements for the vertex base class of the `ApolloniusGraphDataStructure_2` concept. A vertex stores an Apollonius site and provides access to one of its incident faces through a `Face_handle`. In addition, it maintains a container of sites. The container stores the hidden sites related to the vertex
ApolloniusSite_2 | The concept `ApolloniusSite_2` provides the requirements for an Apollonius site class