\( \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 - 2D Voronoi Diagram Adaptor

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2< AG2 > Class Template Reference
Voronoi Diagram of Disks

`#include <CGAL/Apollonius_graph_adaptation_policies_2.h>`

## Definition

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

The template parameter of the `Apollonius_graph_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 Apollonius graph. 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 and no Voronoi faces of zero area.

Is Model Of:
  `AdaptationPolicy_2`

See Also
  `AdaptationTraits_2`
  `DelaunayGraph_2`
  `CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>`
  `CGAL::Voronoi_diagram_2<DG,AT,AP>`
  `CGAL::Apollonius_graph_2<Gt,Agds>`
  `CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>`

## Types
typedef CGAL::Tag_true | Has_inserter