CGAL 5.6 - 2D Segment Delaunay Graphs
|
#include <CGAL/Segment_Delaunay_graph_storage_traits_2.h>
Inherited by CGAL::Segment_Delaunay_graph_storage_traits_with_info_2< Gt, Info, Converter, Merger >.
The class Segment_Delaunay_graph_storage_traits_2
provides a model for the SegmentDelaunayGraphStorageTraits_2
concept.
To avoid redundancy in the storage of points, the input points of a segment Delaunay graph are stored in a container, and the various types of sites (input points and segments, points of intersection, subsegments with one or two points of intersection as endpoints) only store handles to the points in the container.
See section Strongly Intersecting Sites and their Representation for more information.
Gt | must be a model of the concept SegmentDelaunayGraphTraits_2 . |
CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,St,STag,DS>
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>
Public Types | |
typedef unspecified_type | Storage_site_2 |