CGAL 5.3.2 - 2D Apollonius Graphs (Delaunay Graphs of Disks)
CGAL::Apollonius_graph_vertex_base_2< Gt, StoreHidden > Class Template Reference

#include <CGAL/Apollonius_graph_vertex_base_2.h>

Definition

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.

Is Model Of:
ApolloniusGraphVertexBase_2
See also
CGAL::Triangulation_data_structure_2<Vb,Fb>
CGAL::Apollonius_graph_hierarchy_vertex_base_2<Gt>
Examples:
Apollonius_graph_2/ag2_filtered_traits_no_hidden.cpp.

Creation

 Apollonius_graph_vertex_base_2 ()
 Default constructor.
 
 Apollonius_graph_vertex_base_2 (const Site_2 &s)
 Constructs a vertex associated with the site s and embedded at the center of s.
 
 Apollonius_graph_vertex_base_2 (const 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.