\( \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.6 - 2D Voronoi Diagram Adaptor
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2< DT2 > Class Template Reference
Voronoi Diagram of Points

#include <CGAL/Delaunay_triangulation_adaptation_policies_2.h>

Definition

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/vd_2_point_location.cpp.

Types

typedef CGAL::Tag_true Has_inserter