/usr/include/CGAL/convex_hull_2.h is in libcgal-dev 4.11-2build1.
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 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 | // Copyright (c) 1999 Max-Planck-Institute Saarbruecken (Germany).
// 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
// 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) : Stefan Schirra
#ifndef CGAL_CONVEX_HULL_2_H
#define CGAL_CONVEX_HULL_2_H
#include <CGAL/license/Convex_hull_2.h>
#include <CGAL/basic.h>
#include <CGAL/convex_hull_traits_2.h>
#include <CGAL/ch_akl_toussaint.h>
#include <CGAL/ch_bykat.h>
#include <iterator>
namespace CGAL {
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
CGAL_convex_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits,
std::input_iterator_tag )
{ return ch_bykat(first, last, result, ch_traits); }
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
CGAL_convex_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits,
std::forward_iterator_tag )
{ return ch_akl_toussaint(first, last, result, ch_traits); }
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
CGAL_convex_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits,
std::bidirectional_iterator_tag )
{ return ch_akl_toussaint(first, last, result, ch_traits); }
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
CGAL_convex_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits,
std::random_access_iterator_tag )
{ return ch_akl_toussaint(first, last, result, ch_traits); }
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
convex_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits)
{
typedef std::iterator_traits<InputIterator> ITraits;
typedef typename ITraits::iterator_category Category;
return CGAL_convex_hull_points_2(first, last, result, ch_traits,
Category());
}
template <class ForwardIterator, class OutputIterator>
inline
OutputIterator
convex_hull_points_2(ForwardIterator first, ForwardIterator last,
OutputIterator result )
{
typedef std::iterator_traits<ForwardIterator> ITraits;
typedef typename ITraits::value_type value_type;
typedef typename ITraits::iterator_category Category;
typedef CGAL::Kernel_traits<value_type> KTraits;
typedef typename KTraits::Kernel Kernel;
return CGAL_convex_hull_points_2(first, last, result, Kernel(),
Category());
}
// generates the counterclockwise sequence of extreme points
// of the points in the range [|first|,|last|). The resulting sequence
// is placed starting at position |result|, and the past-the-end iterator
// for the resulting sequence is returned. It is not specified, at which
// point the cyclic sequence of extreme points is cut into a linear
// sequence.
// {\it Preconditions:}
// [|first|,|last|) does not contain |result|.
// {\sc traits}: operates on |Traits::Point_2| using |Traits::Less_xy_2|,
// |Traits::Equal_2|, |Traits::Less_yx_2|, and |Traits::Left_turn_2|.
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
convex_hull_2(InputIterator first, InputIterator last,
OutputIterator result, const Traits& ch_traits)
{
return convex_hull_points_2(first, last, result, ch_traits);
}
template <class ForwardIterator, class OutputIterator>
inline
OutputIterator
convex_hull_2(ForwardIterator first, ForwardIterator last,
OutputIterator result )
{
return convex_hull_points_2(first, last, result);
}
// generates the counterclockwise sequence of extreme points
// on the lower hull of the points in the range [|first|,|last|).
// The resulting sequence is placed starting at position |result|,
// and the past-the-end iterator for the resulting sequence is returned.
// The sequence starts with the leftmost point, the rightmost point is
// not included.
// {\it Preconditions:}
// [|first|,|last|) does not contain |result|.
// {\sc traits}: operates on |Traits::Point_2| using |Traits::Less_xy_2|
// |Traits::Equal_2| and |Traits::Left_turn_2|.
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
lower_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits)
{ return ch_lower_hull_scan(first, last, result, ch_traits); }
template <class ForwardIterator, class OutputIterator>
inline
OutputIterator
lower_hull_points_2(ForwardIterator first, ForwardIterator last,
OutputIterator result )
{
typedef std::iterator_traits<ForwardIterator> ITraits;
typedef typename ITraits::value_type value_type;
typedef CGAL::Kernel_traits<value_type> KTraits;
typedef typename KTraits::Kernel Kernel;
return lower_hull_points_2(first, last, result, Kernel());
}
// generates the counterclockwise sequence of extreme points
// on the upper hull of the points in the range [|first|,|last|).
// The resulting sequence is placed starting at position |result|,
// and the past-the-end iterator for the resulting sequence is returned.
// The sequence starts with the rightmost point, the leftmost point is
// not included.
// {\it Preconditions:}
// [|first|,|last|) does not contain |result|.
// {\sc traits}: operates on |Traits::Point_2| using |Traits::Less_xy_2|,
// |Traits::Equal_2| and |Traits::Left_turn_2|.
template <class InputIterator, class OutputIterator, class Traits>
inline
OutputIterator
upper_hull_points_2(InputIterator first, InputIterator last,
OutputIterator result,
const Traits& ch_traits)
{ return ch_upper_hull_scan(first, last, result, ch_traits); }
template <class ForwardIterator, class OutputIterator>
inline
OutputIterator
upper_hull_points_2(ForwardIterator first, ForwardIterator last,
OutputIterator result )
{
typedef std::iterator_traits<ForwardIterator> ITraits;
typedef typename ITraits::value_type value_type;
typedef CGAL::Kernel_traits<value_type> KTraits;
typedef typename KTraits::Kernel Kernel;
return upper_hull_points_2(first, last, result, Kernel());
}
} //namespace CGAL
#endif // CGAL_CONVEX_HULL_2_H
|