/usr/include/CGAL/envelope_2.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 | // Copyright (c) 2006 Tel-Aviv University (Israel).
// 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) : Ron Wein <wein@post.tau.ac.il>
#ifndef CGAL_ENVELOPE_2_H
#define CGAL_ENVELOPE_2_H
/*! \file
* Global functions for computing lower and upper envelopes of curves in the
* plane.
*/
#include <CGAL/Envelope_2/Env_divide_and_conquer_2.h>
namespace CGAL {
/*!
* Compute the lower envelope of a range of curves.
* \param begin An iterator for the first curve.
* \param end A past-the-end iterator for the curves.
* \param diag Output: The minimization diagram.
* \pre The value-type of the iterator is Traits::Curve_2.
*/
template <class InputIterator, class EnvelopeDiagram>
void lower_envelope_2 (InputIterator begin, InputIterator end,
EnvelopeDiagram& diag)
{
typedef typename EnvelopeDiagram::Traits_2 Traits_2;
typedef Envelope_divide_and_conquer_2<Traits_2, EnvelopeDiagram> Envelope_2;
Envelope_2 env;
env.insert_curves (begin, end,
true, // Lower envelope.
diag);
return;
}
/*!
* Compute the upper envelope of a range of curves.
* \param begin An iterator for the first curve.
* \param end A past-the-end iterator for the curves.
* \param diag Output: The maximization diagram.
* \pre The value-type of the iterator is Traits::Curve_2.
*/
template <class InputIterator, class EnvelopeDiagram>
void upper_envelope_2 (InputIterator begin, InputIterator end,
EnvelopeDiagram& diag)
{
typedef typename EnvelopeDiagram::Traits_2 Traits_2;
typedef Envelope_divide_and_conquer_2<Traits_2, EnvelopeDiagram> Envelope_2;
Envelope_2 env;
env.insert_curves (begin, end,
false, // Upper envelope.
diag);
return;
}
/*!
* Compute the lower envelope of a range of x-monotone curves.
* \param begin An iterator for the first x-monotone curve.
* \param end A past-the-end iterator for the x-monotone curves.
* \param diag Output: The minimization diagram.
* \pre The value-type of the iterator is Traits::X_monotone_curve_2.
*/
template <class InputIterator, class EnvelopeDiagram>
void lower_envelope_x_monotone_2 (InputIterator begin, InputIterator end,
EnvelopeDiagram& diag)
{
typedef typename EnvelopeDiagram::Traits_2 Traits_2;
typedef Envelope_divide_and_conquer_2<Traits_2, EnvelopeDiagram> Envelope_2;
Envelope_2 env;
env.insert_x_monotone_curves (begin, end,
true, // Lower envelope.
diag);
return;
}
/*!
* Compute the upper envelope of a range of x-monotone curves.
* \param begin An iterator for the first x-monotone curve.
* \param end A past-the-end iterator for the x-monotone curves.
* \param diag Output: The maximization diagram.
* \pre The value-type of the iterator is Traits::X_monotone_curve_2.
*/
template <class InputIterator, class EnvelopeDiagram>
void upper_envelope_x_monotone_2 (InputIterator begin, InputIterator end,
EnvelopeDiagram& diag)
{
typedef typename EnvelopeDiagram::Traits_2 Traits_2;
typedef Envelope_divide_and_conquer_2<Traits_2, EnvelopeDiagram> Envelope_2;
Envelope_2 env;
env.insert_x_monotone_curves (begin, end,
false, // Upper envelope.
diag);
return;
}
} //namespace CGAL
#endif
|