CGAL 5.1.2 - 2D Apollonius Graphs (Delaunay Graphs of Disks)
|
#include <CGAL/Apollonius_graph_vertex_base_2.h>
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.
The class Apollonius_graph_vertex_base_2
has two template arguments, the first being the geometric traits of the Apollonius graph and should be a model of the concept ApolloniusGraphTraits_2
. The second is a Boolean which controls whether hidden sites are actually stored. Such a control is important if the user is not interested in hidden sites and/or if only insertions are made, in which case no hidden site can become visible. If StoreHidden
is set to true
, hidden sites are stored, otherwise they are discarded. By default StoreHidden
is set to true
.
ApolloniusGraphVertexBase_2
ApolloniusGraphDataStructure_2
ApolloniusGraphTraits_2
CGAL::Triangulation_data_structure_2<Vb,Fb>
CGAL::Apollonius_graph_traits_2<K,Method_tag>
CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
Creation | |
Apollonius_graph_bertex_base_2 () | |
Default constructor. | |
Apollonius_graph_vertex_base_2 (Site_2 s) | |
Constructs a vertex associated with the site s and embedded at the center of s . | |
Apollonius_graph_vertex_base_2 (Site_2 s, Face_handle f) | |
Constructs a vertex associated with the site s , embedded at the center of s , and pointing to the face associated with the face handle f . | |