\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.8.2 - 2D Voronoi Diagram Adaptor
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2< SDG2 > Class Template Reference
Voronoi Diagram of Segments

#include <CGAL/Segment_Delaunay_graph_adaptation_policies_2.h>

Definition

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