CGAL 5.5.2 - Shape Detection
CGAL::Shape_detection::Point_set::Least_squares_line_fit_sorting< GeomTraits, InputRange, NeighborQuery, PointMap > Class Template Reference

#include <CGAL/Shape_detection/Region_growing/Region_growing_on_point_set/Least_squares_line_fit_sorting.h>

Definition

Sorting of 2D points with respect to the local line fit quality.

Indices of 2D input points are sorted with respect to the quality of the least squares line fit applied to the neighboring points of each point.

Template Parameters
GeomTraitsmust be a model of Kernel.
InputRangemust be a model of ConstRange whose iterator type is RandomAccessIterator.
NeighborQuerymust be a model of NeighborQuery.
PointMapmust be an LvaluePropertyMap whose key type is the value type of the input range and value type is Kernel::Point_2.

Initialization

 Least_squares_line_fit_sorting (const InputRange &input_range, NeighborQuery &neighbor_query, const PointMap point_map=PointMap())
 initializes all internal data structures. More...
 

Sorting

void sort ()
 sorts indices of input points.
 

Access

Seed_map seed_map ()
 returns an instance of Seed_map to access the ordered indices of input points.
 

Constructor & Destructor Documentation

◆ Least_squares_line_fit_sorting()

template<typename GeomTraits , typename InputRange , typename NeighborQuery , typename PointMap >
CGAL::Shape_detection::Point_set::Least_squares_line_fit_sorting< GeomTraits, InputRange, NeighborQuery, PointMap >::Least_squares_line_fit_sorting ( const InputRange &  input_range,
NeighborQuery neighbor_query,
const PointMap  point_map = PointMap() 
)

initializes all internal data structures.

Parameters
input_rangean instance of InputRange with 2D points
neighbor_queryan instance of NeighborQuery that is used internally to access point's neighbors
point_mapan instance of PointMap that maps an item from input_range to Kernel::Point_2
Precondition
input_range.size() > 0