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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
|
// Copyright (c) 1997 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and 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 Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/HalfedgeDS/include/CGAL/HalfedgeDS_const_decorator.h $
// $Id: HalfedgeDS_const_decorator.h 35787 2007-01-24 17:16:05Z spion $
//
//
// Author(s) : Lutz Kettner <kettner@mpi-sb.mpg.de>
#ifndef CGAL_HALFEDGEDS_CONST_DECORATOR_H
#define CGAL_HALFEDGEDS_CONST_DECORATOR_H 1
#include <CGAL/HalfedgeDS_items_decorator.h>
#include <vector>
#include <CGAL/IO/Verbose_ostream.h>
CGAL_BEGIN_NAMESPACE
template < class p_HDS >
class HalfedgeDS_const_decorator
: public HalfedgeDS_items_decorator<p_HDS> {
// TYPES (inherited from Items_decorator, but have to be repeated)
// ---------------------------------------------------------------
public:
typedef p_HDS HDS;
typedef p_HDS HalfedgeDS;
typedef typename HDS::Traits Traits;
typedef typename HDS::Vertex Vertex;
typedef typename HDS::Halfedge Halfedge;
typedef typename HDS::Face Face;
typedef typename HDS::Vertex_handle Vertex_handle;
typedef typename HDS::Vertex_const_handle Vertex_const_handle;
typedef typename HDS::Vertex_iterator Vertex_iterator;
typedef typename HDS::Vertex_const_iterator Vertex_const_iterator;
typedef typename HDS::Halfedge_handle Halfedge_handle;
typedef typename HDS::Halfedge_const_handle Halfedge_const_handle;
typedef typename HDS::Halfedge_iterator Halfedge_iterator;
typedef typename HDS::Halfedge_const_iterator Halfedge_const_iterator;
typedef typename HDS::Face_handle Face_handle;
typedef typename HDS::Face_const_handle Face_const_handle;
typedef typename HDS::Face_iterator Face_iterator;
typedef typename HDS::Face_const_iterator Face_const_iterator;
typedef typename HDS::size_type size_type;
typedef typename HDS::difference_type difference_type;
typedef typename HDS::iterator_category iterator_category;
// The following types are equal to either `Tag_true' or `Tag_false',
// dependent whether the named feature is supported or not.
typedef typename HDS::Supports_vertex_halfedge
Supports_vertex_halfedge;
typedef typename HDS::Supports_halfedge_prev Supports_halfedge_prev;
typedef typename HDS::Supports_halfedge_vertex
Supports_halfedge_vertex;
typedef typename HDS::Supports_halfedge_face Supports_halfedge_face;
typedef typename HDS::Supports_face_halfedge Supports_face_halfedge;
typedef typename HDS::Supports_removal Supports_removal;
protected:
typedef typename Vertex::Base VBase;
typedef typename Halfedge::Base HBase;
typedef typename Halfedge::Base_base HBase_base;
typedef typename Face::Base FBase;
// PRIVATE MEMBER VARIABLES
// ----------------------------------
private:
const p_HDS* hds;
// CREATION
// ----------------------------------
public:
// No default constructor, keeps always a reference to a HDS!
HalfedgeDS_const_decorator( const p_HDS& h) : hds(&h) {}
// keeps internally a const reference to `hds'.
bool is_valid( bool verb = false, int level = 0) const;
// returns `true' if the halfedge data structure `hds' is valid
// with respect to the `level' value as defined in the reference
// manual. If `verbose' is `true', statistics are written to
// `cerr'.
bool normalized_border_is_valid( bool verb = false) const;
// returns `true' if the border halfedges are in normalized
// representation, which is when enumerating all halfedges with
// the halfedge iterator the following holds: The non-border edges
// precede the border edges. For border edges, the second halfedge
// is a border halfedge. (The first halfedge may or may not be a
// border halfedge.) The halfedge iterator `border_halfedges_begin
// ()' denotes the first border edge. If `verbose' is `true',
// statistics are written to `cerr'.
};
template < class p_HDS >
bool
HalfedgeDS_const_decorator<p_HDS>::
normalized_border_is_valid( bool verb) const {
bool valid = true;
Verbose_ostream verr(verb);
verr << "begin CGAL::HalfedgeDS_const_decorator<HDS>::"
"normalized_border_is_valid( verb=true):" << std::endl;
Halfedge_const_iterator e = hds->halfedges_begin();
size_type count = 0;
while( e != hds->halfedges_end() && ! e->is_border() && !
e->opposite()->is_border()) {
++e;
++e;
++count;
}
verr << " non-border edges: " << count << std::endl;
if ( e != hds->border_halfedges_begin()) {
verr << " first border edge does not start at "
"border_halfedges_begin()" << std::endl;
valid = false;
} else {
count = 0;
while( valid && e != hds->halfedges_end() &&
e->opposite()->is_border()) {
++e;
++e;
++count;
}
verr << " border edges: " << count << std::endl;
verr << " total edges: " << hds->size_of_halfedges()/2
<< std::endl;
if ( e != hds->halfedges_end()) {
if ( e->is_border()) {
verr << " border edge " << count
<< ": wrong orientation." << std::endl;
}
verr << " the sum of full + border equals not total edges."
<< std::endl;
valid = false;
}
}
verr << "end of CGAL::HalfedgeDS_const_decorator<HDS>::normalized_"
"border_is_valid(): structure is "
<< ( valid ? "valid." : "NOT VALID.") << std::endl;
return valid;
}
template < class p_HDS >
bool
HalfedgeDS_const_decorator<p_HDS>::
is_valid( bool verb, int level) const {
Verbose_ostream verr(verb);
verr << "begin CGAL::HalfedgeDS_const_decorator<HDS>::is_valid("
" verb=true, level = " << level << "):" << std::endl;
bool valid = ( 1 != (hds->size_of_halfedges() & 1));
if ( ! valid)
verr << "number of halfedges is odd." << std::endl;
// All halfedges.
Halfedge_const_iterator begin = hds->halfedges_begin();
Halfedge_const_iterator end = hds->halfedges_end();
size_type n = 0;
size_type nb = 0;
for( ; valid && (begin != end); begin++) {
verr << "halfedge " << n << std::endl;
if ( begin->is_border())
verr << " is border halfedge" << std::endl;
// Pointer integrity.
valid = valid && ( begin->next() != Halfedge_const_handle());
valid = valid && ( begin->opposite() != Halfedge_const_handle());
if ( ! valid) {
verr << " pointer integrity corrupted (ptr==0)."
<< std::endl;
break;
}
// opposite integrity.
valid = valid && ( begin->opposite() != begin);
valid = valid && ( begin->opposite()->opposite() == begin);
if ( ! valid) {
verr << " opposite pointer integrity corrupted."
<< std::endl;
break;
}
// previous integrity.
valid = valid && ( ! check_tag( Supports_halfedge_prev()) ||
get_prev(begin->next()) == begin);
if ( ! valid) {
verr << " previous pointer integrity corrupted."
<< std::endl;
break;
}
if ( level > 0) {
// vertex integrity.
valid = valid && ( ! check_tag( Supports_halfedge_vertex())
|| get_vertex( begin) != Vertex_const_handle());
if ( ! valid) {
verr << " vertex pointer integrity corrupted."
<< std::endl;
break;
}
valid = valid && ( get_vertex( begin) ==
get_vertex( begin->next()->opposite()));
if ( ! valid) {
verr << " vertex pointer integrity2 corrupted."
<< std::endl;
break;
}
// face integrity.
valid = valid && ( ! check_tag( Supports_halfedge_face())
|| begin->is_border()
|| get_face(begin) != Face_const_handle());
if ( ! valid) {
verr << " face pointer integrity corrupted."
<< std::endl;
break;
}
valid = valid && ( get_face(begin) == get_face(begin->next()));
if ( ! valid) {
verr << " face pointer integrity2 corrupted."
<< std::endl;
break;
}
}
++n;
if ( begin->is_border())
++nb;
}
verr << "summe border halfedges (2*nb) = " << 2 * nb << std::endl;
if ( valid && n != hds->size_of_halfedges())
verr << "counting halfedges failed." << std::endl;
if ( valid && level >= 4 && (nb != hds->size_of_border_halfedges()))
verr << "counting border halfedges failed." << std::endl;
valid = valid && ( n == hds->size_of_halfedges());
valid = valid && ( level < 4 ||
(nb == hds->size_of_border_halfedges()));
// All vertices.
Vertex_const_iterator vbegin = hds->vertices_begin();
Vertex_const_iterator vend = hds->vertices_end();
size_type v = 0;
n = 0;
for( ; valid && (vbegin != vend); ++vbegin) {
verr << "vertex " << v << std::endl;
// Pointer integrity.
if ( get_vertex_halfedge( vbegin) != Halfedge_const_handle())
valid = valid && ( ! check_tag(
Supports_halfedge_vertex()) ||
get_vertex( get_vertex_halfedge( vbegin)) == vbegin);
else
valid = valid && (! check_tag(
Supports_vertex_halfedge()));
if ( ! valid) {
verr << " halfedge pointer in vertex corrupted."
<< std::endl;
break;
}
// cycle-around-vertex test.
Halfedge_const_handle h = get_vertex_halfedge( vbegin);
if ( level >= 2 && h != Halfedge_const_handle()) {
Halfedge_const_handle g = h;
do {
verr << " halfedge " << n << std::endl;
++n;
h = h->next()->opposite();
valid = valid && ( n <= hds->size_of_halfedges() && n!=0);
if ( ! valid)
verr << " too many halfedges around vertices."
<< std::endl;
} while ( valid && (h != g));
}
++v;
}
if ( valid && v != hds->size_of_vertices())
verr << "counting vertices failed." << std::endl;
if ( valid && level >= 2 && ( check_tag( Supports_vertex_halfedge())
&& n != hds->size_of_halfedges()))
verr << "counting halfedges via vertices failed." << std::endl;
valid = valid && ( v == hds->size_of_vertices());
valid = valid && ( level < 2 ||
! check_tag( Supports_vertex_halfedge()) ||
n == hds->size_of_halfedges());
// All faces.
Face_const_iterator fbegin = hds->faces_begin();
Face_const_iterator fend = hds->faces_end();
size_type f = 0;
n = 0;
for( ; valid && (fbegin != fend); ++fbegin) {
verr << "face " << f << std::endl;
// Pointer integrity.
if ( get_face_halfedge( fbegin) != Halfedge_const_handle())
valid = valid && ( ! check_tag(
Supports_halfedge_face()) ||
get_face( get_face_halfedge( fbegin)) == fbegin);
else
valid = valid && (! check_tag(
Supports_face_halfedge()) || begin->is_border());
if ( ! valid) {
verr << " halfedge pointer in face corrupted." << std::endl;
break;
}
// cycle-around-face test.
Halfedge_const_handle h = get_face_halfedge( fbegin);
if ( level >= 3 && h != Halfedge_const_handle()) {
Halfedge_const_handle g = h;
do {
verr << " halfedge " << n << std::endl;
++n;
h = h->next();
valid = valid && ( n <= hds->size_of_halfedges() && n!=0);
if ( ! valid)
verr << " too many halfedges around faces."
<< std::endl;
} while ( valid && (h != g));
}
++f;
}
if ( valid && f != hds->size_of_faces())
verr << "counting faces failed." << std::endl;
if ( valid && level >= 3 && check_tag( Supports_face_halfedge()) &&
n + nb != hds->size_of_halfedges())
verr << "counting halfedges via faces failed." << std::endl;
valid = valid && ( f == hds->size_of_faces());
valid = valid && ( level < 3 ||
! check_tag( Supports_face_halfedge()) ||
n + nb == hds->size_of_halfedges());
if ( level >= 4) {
verr << "level 4: normalized_border_is_valid( verbose = true)"
<< std::endl;
valid = valid && ( normalized_border_is_valid( verb));
}
verr << "end of CGAL::HalfedgeDS_const_decorator<HDS>::"
"is_valid(): structure is " << ( valid ? "valid." :
"NOT VALID.") << std::endl;
return valid;
}
CGAL_END_NAMESPACE
#endif // CGAL_HALFEDGEDS_CONST_DECORATOR_H //
// EOF //
|
