CGAL 6.1.1 - 2D Voronoi Diagram Adaptor

Loading...
Searching...
No Matches
List of all members
CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2< DT2 > Struct Template Reference
Reference Manual » Voronoi Diagram of Points

`#include <CGAL/Delaunay_triangulation_adaptation_policies_2.h>`

## Definition

template<typename DT2>
struct CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2< DT2 >

The class `Delaunay_triangulation_caching_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept.

The template parameter of the `Delaunay_triangulation_caching_degeneracy_removal_policy_2` class must be a model of the `DelaunayGraph_2` concept, and in particular it has the semantics of a (triangulated) 2D Delaunay triangulation. This policy caches the results of the edge and face rejectors and results in a Voronoi diagram that has no degenerate features, i.e., no Voronoi edges of zero length.

Is model of
  `AdaptationPolicy_2`

See also
  `AdaptationTraits_2`
  `DelaunayGraph_2`
  `CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>`
  `CGAL::Voronoi_diagram_2<DG,AT,AP>`
  `CGAL::Delaunay_triangulation_2<Traits,Tds>`

Examples
  Voronoi_diagram_2/draw_voronoi_diagram_2.cpp, and Voronoi_diagram_2/vd_2_point_location.cpp.

## Types
typedef CGAL::Tag_true | Has_inserter