/usr/include/vigra/polygon.hxx is in libvigraimpex-dev 1.9.0+dfsg-10+b2.
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 128 129 130 | /************************************************************************/
/* */
/* Copyright 1998-2010 by Ullrich Koethe */
/* */
/* This file is part of the VIGRA computer vision library. */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_POLYGON_HXX
#define VIGRA_POLYGON_HXX
#include <cmath>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#include "config.hxx"
#include "error.hxx"
#include "array_vector.hxx"
namespace vigra {
/** \addtogroup MathFunctions
*/
//@{
namespace detail {
template < class Point >
bool sortPoints(Point const & p1, Point const & p2)
{
return (p1[0]<p2[0]) || (p1[0] == p2[0] && p1[1] < p2[1]);
}
template < class Point >
bool orderedClockwise(const Point &O, const Point &A, const Point &B)
{
return (A[0] - O[0]) * (B[1] - O[1]) - (A[1] - O[1]) * (B[0] - O[0]) <= 0;
}
} // namespace detail
/** \brief Compute convex hull of a 2D polygon.
The input array \a points contains a (not necessarily ordered) set of 2D points
whose convex hull is to be computed. The array's <tt>value_type</tt> (i.e. the point type)
must be compatible with std::vector (in particular, it must support indexing,
copying, and have <tt>size() == 2</tt>). The points of the convex hull will be appended
to the output array \a convex_hull (which must support <tt>std::back_inserter(convex_hull)</tt>).
Since the convex hull is a closed polygon, the first and last point of the output will
be the same (i.e. the first point will simply be inserted at the end again). The points
of the convex hull will be ordered counter-clockwise, starting with the leftmost point
of the input. The function implements Andrew's Monotone Chain algorithm.
*/
template<class PointArray1, class PointArray2>
void convexHull(const PointArray1 &points, PointArray2 & convex_hull)
{
vigra_precondition(points.size() >= 2,
"convexHull(): at least two input points are needed.");
vigra_precondition(points[0].size() == 2,
"convexHull(): 2-dimensional points required.");
typedef typename PointArray1::value_type Point;
ArrayVector<Point> ordered(points.begin(), points.end());
std::sort(ordered.begin(), ordered.end(), detail::sortPoints<Point>);
ArrayVector<Point> H;
int n = points.size(), k=0;
// Build lower hull
for (int i = 0; i < n; i++)
{
while (k >= 2 && detail::orderedClockwise(H[k-2], H[k-1], ordered[i]))
{
H.pop_back();
--k;
}
H.push_back(ordered[i]);
++k;
}
// Build upper hull
for (int i = n-2, t = k+1; i >= 0; i--)
{
while (k >= t && detail::orderedClockwise(H[k-2], H[k-1], ordered[i]))
{
H.pop_back();
--k;
}
H.push_back(ordered[i]);
++k;
}
std::copy(H.begin(), H.begin()+k, std::back_inserter(convex_hull));
}
//@}
} // namespace vigra
#endif /* VIGRA_POLYGON_HXX */
|