A neighbor query based on a Delaunay triangulation, which enables to find the nearest neighbors in a set of GeomTraits::Segment_2.
This class finds indices of the nearest neighbors of a query segment in a set of 2D segments.
The class first creates a Delaunay triangulation whose vertices are center points of the input segments and then enables to return for each query segment indices of the segments whose center points form the one-ring neighborhood of the corresponding query vertex in the triangulation.
a model of ReadablePropertyMap whose key type is the value type of the InputRange and value type is GeomTraits::Segment_2. The default is CGAL::Identity_property_map<typename GeomTraits::Segment_2>.
inserts a group of segments from input_range and finds their neighbors within the group.
Each group of segments is provided as a collection of their indices and only neighbors of segments within the group are computed that is no relationships between segments from different groups are taken into account.
The user must not use this method until he has meaningful groups of segments (see more in the user manual). By default, all segments are inserted as a group.
Template Parameters
IndexRange
a model of ConstRange whose value type is std::size_t
1.8.13