The concept AdaptationPolicy_2 defines the requirements on the predicate functors that determine whether a feature of the triangulated Delaunay graph should be rejected or not. It also provides a functor for inserting sites in the Delaunay graph. The last functor is optional and a tag determines whether it is provided or not. Note that while the first two functors do not modify the Delaunay graph they take as an argument, the last ones does.
 
A type for the sites of the Voronoi diagram.
 
 
A type for the triangulated Delaunay
graph. The type Delaunay_graph must be a model of the
DelaunayGraph_2 concept.

 
A type for the predicate functor that is
responsible for rejecting an edge of the Delaunay graph (or
equivalently rejecting its dual edge in the Voronoi diagram). It must be
model of the concepts DefaultConstructible,
CopyConstructible, Assignable, and AdaptableFunctor
(with two arguments). It must provide the following operators: bool operator()(Delaunay_graph dg, Delaunay_edge e) bool operator()(Delaunay_graph dg, Delaunay_face_handle f, int i) bool operator()(Delaunay_graph dg, Delaunay_edge_circulator ec) bool operator()(Delaunay_graph dg, All_Delaunay_edges_iterator eit) bool operator()(Delaunay_graph dg, Finite_Delaunay_edges_iterator eit) The functor returns true iff the edge is rejected.
 
 
A type for the predicate functor that is
responsible for rejecting a vertex of the Delaunay graph (or
equivalently its dual face in the Voronoi diagram  hence the name
of the functor). It must be model of the concepts DefaultConstructible,
CopyConstructible, Assignable, AdaptableFunctor
(with two arguments). It must provide the following operator: The functor returns true iff the face is rejected.
 
 
A tag for determining if the adaptation
policy class provides a functor for inserting sites in the Delaunay
graph. This tag is equal to either CGAL::Tag_true (a site
inserter functor is available) ir CGAL::Tag_false (a site
inserter functor is not available).
 
 
A type for a functor that inserts sites
in the Delaunay graph. It must be model of the concepts
DefaultConstructible, CopyConstructible, Assignable,
AdaptableFunctor (with two arguments). It must provide the
following operator The vertex handle returned either points to the vertex of the Delaunay graph corresponding to the site just inserted or is the default constructed vertex handle. The latter case can happen if the site inserted is hidden, i.e., it has an empty Voronoi cell. This type is required only if the Has_inserter tag is equal to CGAL::Tag_true.


 

 

 
This method is required only if Has_inserter is equal to CGAL::Tag_true. 

 Clears the state of the adaptation policy. 

 The adaptation policies ap and other are swapped. This method should be preferred to ap=other or ap(other) if other is deleted afterwards. 

 Tests the validity of the adaptation policy. 

 
Tests the validity of the adaptation policy using extra information from the Delaunay graph dg. 