\( \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 Segment Delaunay Graphs
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Segment_Delaunay_graph_vertex_base_2< Gt, SSTag > Class Template Reference
2D Segment Delaunay Graphs Reference

#include <CGAL/Segment_Delaunay_graph_vertex_base_2.h>

Definition

The class Segment_Delaunay_graph_vertex_base_2 provides a model for the SegmentDelaunayGraphVertexBase_2 concept which is the vertex base required by the SegmentDelaunayGraphDataStructure_2 concept.

The class Segment_Delaunay_graph_vertex_base_2 has two template arguments, the first being the geometric traits of the segment Delaunay graph and should be a model of the concept SegmentDelaunayGraphTraits_2. The second template argument indicates whether or not to use the simple storage site that does not support intersecting segments, or the full storage site, that supports intersecting segments. The possible values are Tag_true and Tag_false. Tag_true indicates that the full storage site is to be used, whereas Tag_false indicates that the simple storage site is to be used.

Is Model Of:
SegmentDelaunayGraphVertexBase_2
See Also
SegmentDelaunayGraphVertexBase_2
SegmentDelaunayGraphDataStructure_2
SegmentDelaunayGraphTraits_2
CGAL::Triangulation_data_structure_2<Vb,Fb>
CGAL::Segment_Delaunay_graph_traits_2<K,MTag>
CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>
CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>