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

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1 2 3]

CGAL |
Apollonius_graph_caching_degeneracy_removal_policy_2 | The class `Apollonius_graph_caching_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Apollonius_graph_degeneracy_removal_policy_2 | The class `Apollonius_graph_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Apollonius_graph_adaptation_traits_2 | The class `Apollonius_graph_adaptation_traits_2` provides a model for the `AdaptationTraits_2` concept
Delaunay_triangulation_caching_degeneracy_removal_policy_2 | The class `Delaunay_triangulation_caching_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Delaunay_triangulation_degeneracy_removal_policy_2 | The class `Delaunay_triangulation_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Delaunay_triangulation_adaptation_traits_2 | The class `Delaunay_triangulation_adaptation_traits_2` provides a model for the `AdaptationTraits_2` concept
Identity_policy_2 | The class `Identity_policy_2` provides a model for the `AdaptationPolicy_2` concept
Regular_triangulation_caching_degeneracy_removal_policy_2 | The class `Regular_triangulation_caching_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Regular_triangulation_degeneracy_removal_policy_2 | The class `Regular_triangulation_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Regular_triangulation_adaptation_traits_2 | The class `Regular_triangulation_adaptation_traits_2` provides a model for the `AdaptationTraits_2` concept
Segment_Delaunay_graph_caching_degeneracy_removal_policy_2 | The class `Segment_Delaunay_graph_caching_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Segment_Delaunay_graph_degeneracy_removal_policy_2 | The class `Segment_Delaunay_graph_degeneracy_removal_policy_2` provides a model for the `AdaptationPolicy_2` concept
Segment_Delaunay_graph_adaptation_traits_2 | The class `Segment_Delaunay_graph_adaptation_traits_2` provides a model for the `AdaptationTraits_2` concept
Voronoi_diagram_2 | The class `Voronoi_diagram_2` provides an adaptor that enables us to view a triangulated Delaunay graph as their dual subdivision, the Voronoi diagram
Face | The class `Face` is the class provided by the `Voronoi_diagram_2<DG,AT,AP>` class for Voronoi faces
Halfedge | The class `Halfedge` is the class provided by the `Voronoi_diagram_2<DG,AT,AP>` class for Voronoi halfedges
Vertex | The class `Vertex` is the Voronoi vertex class provided by the class `Voronoi_diagram_2<DG,AT,AP>` class
AdaptationPolicy_2 | The concept `AdaptationPolicy_2` defines the requirements on the predicate functors that determine whether a feature of the triangulated Delaunay graph should be rejected or not. It also provides a functor for inserting sites in the Delaunay graph. The last functor is optional and a tag determines whether it is provided or not. Note that while the first two functors do not modify the Delaunay graph they take as an argument, the last ones does
AdaptationTraits_2 | The concept `AdaptationTraits_2` defines the functors required for accessing geometric information in the Delaunay graph that is needed by the `Voronoi_diagram_2<DG,AT,AP>` class. It optionally defines a functor for performing nearest site queries. A tag is provided for determining whether this functor is defined or not
DelaunayGraph_2 | The concept `DelaunayGraph_2` defines the requirements for the first template parameter of the `Voronoi_diagram_2<DG,AT,AP>` class. The `DelaunayGraph_2` concept essentially defines the requirements that a class representing a Delaunay graph must obey so that the Voronoi diagram adaptor can adapt it