CGAL 5.3.2 - 2D Segment Delaunay Graphs
|
The concept SegmentDelaunayGraphStorageTraits_2
provides the requirements for the storage traits of a segment Delaunay graph.
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.
SegmentDelaunayGraphTraits_2
Types | |
typedef unspecified_type | Geom_traits |
The geometric traits type. More... | |
typedef std::set< typename Geom_traits::Point_2 > | Point_container |
A container of unique points, used to associate a unique handle to each unique input geometric position. | |
typedef Point_container::iterator | Point_handle |
typedef Point_container::const_iterator | const_Point_handle |
typedef unspecified_type | Storage_site_2 |
Type for the storage site. More... | |
typedef CGAL::SegmentDelaunayGraph_2::Construct_storage_site_2< Self > | Construct_storage_site_2 |
Type of the storage site construction functor. | |
Creation | |
SegmentDelaunayGraphStorageTraits_2 (const Geom_traits >=Geom_traits()) | |
Constructor. | |
Access Functions | |
const Geom_traits & | geom_traits () const |
returns the geometric traits. | |
The geometric traits type.
It must be a model of SegmentDelaunayGraphTraits_2
.
Type for the storage site.
It must be a model of SegmentDelaunayGraphStorageSite_2
.