/usr/include/CGAL/General_polygon_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 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 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 | // Copyright (c) 2005 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) : Baruch Zukerman <baruchzu@post.tau.ac.il>
#ifndef CGAL_GENERAL_POLYGON_2_H
#define CGAL_GENERAL_POLYGON_2_H
#include <list>
#include <CGAL/Boolean_set_operations_2/Gps_traits_adaptor.h>
#include <CGAL/Bbox_2.h>
namespace CGAL {
template <class Arr_traits>
class General_polygon_2
{
public:
typedef Arr_traits Traits_2;
typedef typename Traits_2::Point_2 Point_2;
typedef typename Traits_2::X_monotone_curve_2 X_monotone_curve_2;
typedef std::list<X_monotone_curve_2> Containter;
typedef typename Containter::iterator Curve_iterator;
typedef typename Containter::const_iterator Curve_const_iterator;
protected:
std::list<X_monotone_curve_2> m_xcurves;
public:
General_polygon_2(){}
template <class CurveIterator>
General_polygon_2(CurveIterator begin,
CurveIterator end) : m_xcurves (begin, end)
{}
template <class CurveIterator>
void init(CurveIterator begin, CurveIterator end)
{
m_xcurves.clear();
m_xcurves.insert(m_xcurves.end(), begin, end);
}
template <class CurveIterator>
void insert(CurveIterator begin, CurveIterator end)
{
m_xcurves.insert(m_xcurves.end(), begin, end);
}
bool is_empty() const
{
return m_xcurves.empty();
}
unsigned int size() const
{
return static_cast<unsigned int>(m_xcurves.size());
}
Curve_iterator curves_begin()
{
return m_xcurves.begin();
}
Curve_iterator curves_end()
{
return m_xcurves.end();
}
Curve_const_iterator curves_begin() const
{
return m_xcurves.begin();
}
Curve_const_iterator curves_end() const
{
return m_xcurves.end();
}
void push_back(const X_monotone_curve_2& cv)
{
m_xcurves.push_back(cv);
}
void clear()
{
m_xcurves.clear();
}
Curve_iterator erase(Curve_iterator it)
{
return (m_xcurves.erase(it));
}
Orientation orientation() const
{
Gps_traits_adaptor<Traits_2> tr;
return (tr.orientation_2_object()(m_xcurves.begin(), m_xcurves.end()));
}
void reverse_orientation()
{
m_xcurves.reverse();
Traits_2 tr;
typename Traits_2::Construct_opposite_2 ctr_opp =
tr.construct_opposite_2_object();
for(Curve_iterator ci = m_xcurves.begin(); ci != m_xcurves.end(); ++ci)
{
const X_monotone_curve_2& opp_cv = ctr_opp(*ci);
*ci = opp_cv;
}
}
template <class OutputIterator>
void approximate(OutputIterator oi, unsigned int n) const
{
for(Curve_const_iterator itr = m_xcurves.begin();
itr != m_xcurves.end();
++itr)
{
itr->approximate(oi, n);
}
}
Bbox_2 bbox() const
{
Bbox_2 result;
if(m_xcurves.empty())
return (result);
Curve_const_iterator first = m_xcurves.begin();
result = first->bbox();
for(++first; first != m_xcurves.end(); ++first)
{
result = result + first->bbox();
}
return result;
}
};
//-----------------------------------------------------------------------//
// operator>>
//-----------------------------------------------------------------------//
template <class Traits>
std::istream &operator>>(std::istream &is, General_polygon_2<Traits>& p)
{
int n; // number of edges
is >> n;
typename Traits::X_monotone_curve_2 cv;
if (is) {
p.clear();
for (int i=0; i<n; i++) {
is >> cv;
p.push_back(cv);
}
}
return is;
}
//-----------------------------------------------------------------------//
// operator<<
//-----------------------------------------------------------------------//
template <class Traits>
std::ostream
&operator<<(std::ostream &os, const General_polygon_2<Traits>& p)
{
typename General_polygon_2<Traits>::Curve_const_iterator i;
switch(os.iword(IO::mode)) {
case IO::ASCII :
os << p.size() << ' ';
for (i = p.curves_begin(); i != p.curves_end(); ++i) {
os << *i << ' ';
}
return os;
case IO::BINARY :
os << p.size();
for (i = p.curves_begin(); i != p.curves_end(); ++i) {
os << *i;
}
return os;
default:
os << "Polygon_2(" << std::endl;
for (i = p.curves_begin(); i != p.curves_end(); ++i) {
os << " " << *i << std::endl;
}
os << ")" << std::endl;
return os;
}
}
} //namespace CGAL
#endif
|