CGAL 6.2 - Principal Component Analysis

Loading...
Searching...
No Matches
Functions
CGAL Namespace Reference

## Functions
template<typename InputIterator >
Deduced | barycenter (InputIterator first, InputIterator beyond)
| computes the barycenter of a non-empty set of 2D or 3D weighted points.
template<typename InputIterator , typename K >
Deduced | barycenter (InputIterator first, InputIterator beyond, const K &k)
| computes the barycenter of a non-empty set of 2D or 3D weighted points.
template<typename InputIterator , typename Tag >
Deduced | centroid (InputIterator first, InputIterator beyond, const Tag &t)
| computes the centroid of a non-empty set of 2D or 3D objects.
template<typename InputIterator , typename K , typename Tag >
Deduced | centroid (InputIterator first, InputIterator beyond, const K &k, const Tag &t)
| computes the centroid of a non-empty set of 2D or 3D objects.
template<typename InputIterator , typename K , typename Tag , typename DiagonalizeTraits_ >
K::FT | linear_least_squares_fitting_2 (InputIterator first, InputIterator beyond, typename K::Line_2 &line, typename K::Point_2 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
| computes the best fitting 2D line of a 2D object set in the range [`first`,`beyond`).
template<typename InputIterator >
Deduced | bounding_box (InputIterator first, InputIterator beyond)
| The function `bounding_box()` computes the axis-aligned bounding box of a set of 2D or 3D points.
template<typename InputIterator , typename K >
Deduced | bounding_box (InputIterator first, InputIterator beyond, const K &k)
| computes the bounding box of a non-empty set of 2D or 3D points.
template<typename InputIterator , typename K , typename Tag , typename DiagonalizeTraits_ >
K::FT | linear_least_squares_fitting_3 (InputIterator first, InputIterator beyond, typename K::Line_3 &line, typename K::Point_3 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
| The function `linear_least_squares_fitting_3()` computes the best fitting 3D line or plane (in the least squares sense) of a set of 3D objects such as points, segments, triangles, spheres, balls, iso cuboids or tetrahedra.
template<typename InputIterator , typename K , typename Tag , typename DiagonalizeTraits_ >
K::FT | linear_least_squares_fitting_3 (InputIterator first, InputIterator beyond, typename K::Plane_3 &plane, typename K::Point_3 &centroid, const Tag &tag, const K &k, const DiagonalizeTraits_ &diagonalize_traits)
| computes the best fitting 3D plane of a 3D object set in the range [`first`,`beyond`).