CGAL 6.1 - 2D Voronoi Diagram Adaptor

Loading...
Searching...
No Matches
List of all members
CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2< SDG2 > Struct Template Reference
Reference Manual » Voronoi Diagram of Segments

`#include <CGAL/Segment_Delaunay_graph_adaptation_policies_2.h>`

## Definition

template<typename SDG2>
struct CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2< SDG2 >

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

The template parameter of the `Segment_Delaunay_graph_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 segment Delaunay graphs. This policy results in a Voronoi diagram that has no degenerate features, i.e., it has no Voronoi edges of zero length and no Voronoi faces of zero area.

Is model of
  `AdaptationPolicy_2`

See also
  `AdaptationTraits_2`
  `DelaunayGraph_2`
  `CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>`
  `CGAL::Voronoi_diagram_2<DG,AT,AP>`
  `CGAL::Segment_Delaunay_graph_2<Gt,DS>`
  `CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>`

Examples
  Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp.

## Types
typedef CGAL::Tag_true | Has_inserter