/usr/include/CGAL/barycenter.h is in libcgal-dev 4.2-5ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 | // Copyright (c) 2005 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Sylvain Pion
#ifndef CGAL_BARYCENTER_H
#define CGAL_BARYCENTER_H
#include <CGAL/basic.h>
#include <iterator>
#include <CGAL/Kernel_traits.h>
#include <CGAL/Kernel/Dimension_utils.h>
#include <CGAL/Dimension.h>
// Functions to compute the point given its barycentric coordinates.
// Works in 2D and 3D (and dD ?).
// Special case for the centroid.
// TODO : Note : more numerically stable variants could be implemented as well.
// TODO : Specify a traits class concept ? Maybe not for these computations.
// TODO : Grep for "barycenter" and "centroid" in CGAL to check existing usages.
// TODO : Add barycentric_coordinates() (to the kernel, this time).
namespace CGAL {
// This one takes an iterator range over std::pair<K::Point_[23], K::FT>
template < typename InputIterator, typename K >
typename std::iterator_traits<InputIterator>::value_type::first_type
barycenter(InputIterator begin, InputIterator end, const K & )
{
typedef typename std::iterator_traits<InputIterator>::value_type pair;
typedef typename pair::second_type FT;
typedef typename pair::first_type Point;
typedef typename Access::Vector<K, typename Ambient_dimension<Point, K>::type>::type Vector;
CGAL_precondition(begin != end);
Vector v = NULL_VECTOR;
FT norm = 0;
while (begin != end) {
pair p = *begin++;
v = v + p.second * (p.first - ORIGIN);
norm += p.second;
}
CGAL_assertion( norm != 0 );
return ORIGIN + v / norm;
}
// This one takes an iterator range over K::Point_[23],
// and an iterator over K::FT.
template < typename PointInputIterator, typename WeightInputIterator,
typename K >
typename std::iterator_traits<PointInputIterator>::value_type
barycenter(PointInputIterator begin, PointInputIterator end,
WeightInputIterator wbegin, const K & )
{
typedef typename std::iterator_traits<PointInputIterator>::value_type Point;
typedef typename std::iterator_traits<WeightInputIterator>::value_type FT;
typedef typename Access::Vector<K, typename Ambient_dimension<Point, K>::type>::type Vector;
CGAL_precondition(begin != end);
Vector v = NULL_VECTOR;
FT norm = 0;
while (begin != end) {
FT weight = *wbegin++;
v = v + weight * (*begin++ - ORIGIN);
norm += weight;
}
CGAL_assertion( norm != 0 );
return ORIGIN + v / norm;
}
// This one takes an iterator range over std::pair<K::Point_[23], K::FT>
// And it uses Kernel_traits<> to find out its kernel.
template < typename InputIterator >
inline
typename std::iterator_traits<InputIterator>::value_type::first_type
barycenter(InputIterator begin, InputIterator end)
{
typedef typename std::iterator_traits<InputIterator>::value_type pair;
typedef typename pair::first_type Point;
typedef typename Kernel_traits<Point>::Kernel K;
return CGAL::barycenter(begin, end, K());
}
// This one takes an iterator range over K::Point_[23],
// and an iterator over K::FT.
// And it uses Kernel_traits<> to find out its kernel.
// To differentiate it from the others, it takes an "int" as K parameter
template < typename PointInputIterator, typename WeightInputIterator >
inline
typename std::iterator_traits<PointInputIterator>::value_type
barycenter(PointInputIterator begin, PointInputIterator end,
WeightInputIterator wbegin, int)
{
typedef typename std::iterator_traits<PointInputIterator>::value_type Point;
typedef typename Kernel_traits<Point>::Kernel K;
return CGAL::barycenter(begin, end, wbegin, K());
}
} //namespace CGAL
#endif
|