\( \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.11 - 2D Apollonius Graphs (Delaunay Graphs of Disks)
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
2D Apollonius Graphs (Delaunay Graphs of Disks) Reference

Concepts

conceptApolloniusGraphDataStructure_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. More...
 
conceptApolloniusGraphHierarchyVertexBase_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. More...
 
conceptApolloniusGraphTraits_2
 
conceptApolloniusGraphVertexBase_2
 
conceptApolloniusSite_2
 The concept ApolloniusSite_2 provides the requirements for an Apollonius site class. More...