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
|
// Copyright (c) 1997
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org)
//
// $URL: https://github.com/CGAL/cgal/blob/v6.1.1/Polygon/include/CGAL/Polygon_2/Polygon_2_impl.h $
// $Id: include/CGAL/Polygon_2/Polygon_2_impl.h 08b27d3db14 $
// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
//
//
// Author(s) : Wieger Wesselink <wieger@cs.ruu.nl>
//-----------------------------------------------------------------------//
// operator==
//-----------------------------------------------------------------------//
namespace CGAL {
namespace i_polygon {
template <class Equal_2, class Point_2>
class Equal_pred {
Equal_2 m_equal_2;
Point_2 m_pt;
public:
Equal_pred(Equal_2 equal_2, Point_2 const &pt)
: m_equal_2(equal_2), m_pt(pt) {}
bool operator()(Point_2 const &pt) const
{ return m_equal_2(m_pt, pt); }
};
}
template <class Traits_P, class Container1_P, class Container2_P>
bool operator==( const Polygon_2<Traits_P,Container1_P> &x,
const Polygon_2<Traits_P,Container2_P> &y )
{
if (&x == &y)
return true;
typedef typename Traits_P::Equal_2 Equal_2;
typedef typename Traits_P::Point_2 Point_2;
if ((x.size() == 0) && (y.size() == 0)) return true;
if (x.size() != y.size()) return false;
Equal_2 equal_2 = x.traits_member().equal_2_object();
typename Polygon_2<Traits_P,Container1_P>::Vertex_const_iterator x_iter =
x.vertices_begin();
typename Polygon_2<Traits_P,Container2_P>::Vertex_const_iterator y_iter =
std::find_if(y.vertices_begin(), y.vertices_end(),
i_polygon::Equal_pred<Equal_2, Point_2>(equal_2, *x.vertices_begin()));
// if y doesn't contain the first point of x ...
if (y_iter == y.vertices_end()) return false;
++x_iter;
++y_iter;
while (y_iter != y.vertices_end()) {
if (!equal_2(*x_iter, *y_iter)) return false;
++x_iter;
++y_iter;
}
y_iter = y.vertices_begin();
while (x_iter != x.vertices_end()) {
if (!equal_2(*x_iter, *y_iter)) return false;
++x_iter;
++y_iter;
}
return true;
}
//-----------------------------------------------------------------------//
// operator>>
//-----------------------------------------------------------------------//
template <class Traits_P, class Container_P>
std::istream &
operator>>(std::istream &is, Polygon_2<Traits_P,Container_P>& p)
{
int n = 0; // number of vertices
is >> n;
typename Traits_P::Point_2 point;
if (is) {
p.erase(p.vertices_begin(),p.vertices_end());
p.reserve(n);
for (int i=0; i<n; i++) {
if(is >> point){
p.push_back(point);
}
else
{
return is;
}
}
}
return is;
}
//-----------------------------------------------------------------------//
// operator<<
//-----------------------------------------------------------------------//
template <class Traits_P, class Container_P>
std::ostream&
operator<<(std::ostream &os, const Polygon_2<Traits_P,Container_P>& p)
{
typename Polygon_2<Traits_P,Container_P>::Vertex_const_iterator i;
switch(IO::get_mode(os)) {
case IO::ASCII :
os << p.size() << ' ';
for (i = p.vertices_begin(); i != p.vertices_end(); ++i) {
os << *i << ' ';
}
return os;
case IO::BINARY :
os << p.size();
for (i = p.vertices_begin(); i != p.vertices_end(); ++i) {
os << *i;
}
return os;
default:
os << "Polygon_2(" << std::endl;
for (i = p.vertices_begin(); i != p.vertices_end(); ++i) {
os << " " << *i << std::endl;
}
os << ")" << std::endl;
return os;
}
}
//-----------------------------------------------------------------------//
// transform
//-----------------------------------------------------------------------//
template <class Transformation, class Traits_P, class Container_P>
Polygon_2<Traits_P,Container_P>
transform(const Transformation& t, const Polygon_2<Traits_P,Container_P>& p)
{
typedef typename Polygon_2<Traits_P,Container_P>::Vertex_const_iterator VI;
Polygon_2<Traits_P,Container_P> result;
result.reserve(p.size());
for (VI i = p.vertices_begin(); i != p.vertices_end(); ++i)
result.push_back(t(*i));
return result;
}
} //namespace CGAL
|
