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
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
|
// Copyright (c) 2005 INRIA (France).
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Surface_mesh_parameterization/include/CGAL/Square_border_parameterizer_3.h $
// $Id: Square_border_parameterizer_3.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Laurent Saboret, Pierre Alliez, Bruno Levy
#ifndef CGAL_SQUAREBORDERPARAMETERIZER_3_H
#define CGAL_SQUAREBORDERPARAMETERIZER_3_H
#include <CGAL/surface_mesh_parameterization_assertions.h>
#include <CGAL/Parameterizer_traits_3.h>
#include <cfloat>
#include <climits>
#include <vector>
namespace CGAL {
//
// Class Square_border_parameterizer_3
//
/// This is the base class of strategies that parameterize the border
/// of a 3D surface onto a square.
/// Square_border_parameterizer_3 is a pure virtual class, thus
/// cannot be instantiated.
///
/// It implements most of the algorithm. Subclasses just
/// have to implement compute_edge_length() to compute a segment's length.
///
/// Implementation note:
/// To simplify the implementation, BorderParameterizer_3 models know only the
/// ParameterizationMesh_3 class. They do not know the parameterization algorithm
/// requirements or the kind of sparse linear system used.
///
/// @heading Is Model for the Concepts:
/// Model of the BorderParameterizer_3 concept (although you cannot instantiate this class).
///
/// @heading Design Pattern:
/// BorderParameterizer_3 models are Strategies [GHJV95]: they implement
/// a strategy of border parameterization for models of ParameterizationMesh_3.
template<class ParameterizationMesh_3> //< 3D surface
class Square_border_parameterizer_3
{
// Public types
public:
/// Export ParameterizationMesh_3 template parameter.
typedef ParameterizationMesh_3 Adaptor;
// Private types
private:
// Mesh_Adaptor_3 subtypes:
typedef typename Adaptor::NT NT;
typedef typename Adaptor::Point_2 Point_2;
typedef typename Adaptor::Point_3 Point_3;
typedef typename Adaptor::Vector_2 Vector_2;
typedef typename Adaptor::Vector_3 Vector_3;
typedef typename Adaptor::Facet Facet;
typedef typename Adaptor::Facet_handle Facet_handle;
typedef typename Adaptor::Facet_const_handle
Facet_const_handle;
typedef typename Adaptor::Facet_iterator Facet_iterator;
typedef typename Adaptor::Facet_const_iterator
Facet_const_iterator;
typedef typename Adaptor::Vertex Vertex;
typedef typename Adaptor::Vertex_handle Vertex_handle;
typedef typename Adaptor::Vertex_const_handle
Vertex_const_handle;
typedef typename Adaptor::Vertex_iterator Vertex_iterator;
typedef typename Adaptor::Vertex_const_iterator
Vertex_const_iterator;
typedef typename Adaptor::Border_vertex_iterator
Border_vertex_iterator;
typedef typename Adaptor::Border_vertex_const_iterator
Border_vertex_const_iterator;
typedef typename Adaptor::Vertex_around_facet_circulator
Vertex_around_facet_circulator;
typedef typename Adaptor::Vertex_around_facet_const_circulator
Vertex_around_facet_const_circulator;
typedef typename Adaptor::Vertex_around_vertex_circulator
Vertex_around_vertex_circulator;
typedef typename Adaptor::Vertex_around_vertex_const_circulator
Vertex_around_vertex_const_circulator;
typedef typename std::vector<double> Offset_map;
// Public operations
public:
/// Destructor of base class should be virtual.
virtual ~Square_border_parameterizer_3() {}
// Default constructor, copy constructor and operator =() are fine
/// Assign to mesh's border vertices a 2D position (i.e. a (u,v) pair)
/// on border's shape. Mark them as "parameterized".
typename Parameterizer_traits_3<Adaptor>::Error_code
parameterize_border(Adaptor& mesh);
/// Indicate if border's shape is convex.
bool is_border_convex () { return true; }
// Protected operations
protected:
/// Compute the length of an edge.
virtual double compute_edge_length(const Adaptor& mesh,
Vertex_const_handle source,
Vertex_const_handle target) = 0;
// Private operations
private:
/// Compute the total length of the border.
double compute_border_length(const Adaptor& mesh);
/// Get mesh iterator whose offset is closest to 'value'.
Border_vertex_iterator closest_iterator(Adaptor& mesh,
const Offset_map& offsets,
double value);
};
// Compute the total length of the border.
template<class Adaptor>
inline
double Square_border_parameterizer_3<Adaptor>::compute_border_length(
const Adaptor& mesh)
{
double len = 0.0;
for(Border_vertex_const_iterator it = mesh.mesh_main_border_vertices_begin();
it != mesh.mesh_main_border_vertices_end();
it++)
{
CGAL_surface_mesh_parameterization_assertion(mesh.is_vertex_on_main_border(it));
// Get next iterator (looping)
Border_vertex_const_iterator next = it;
next++;
if(next == mesh.mesh_main_border_vertices_end())
next = mesh.mesh_main_border_vertices_begin();
// Add 'length' of it -> next vector to 'len'
len += compute_edge_length(mesh, it, next);
}
return len;
}
// Assign to mesh's border vertices a 2D position (i.e. a (u,v) pair)
// on border's shape. Mark them as "parameterized".
template<class Adaptor>
inline
typename Parameterizer_traits_3<Adaptor>::Error_code
Square_border_parameterizer_3<Adaptor>::parameterize_border(Adaptor& mesh)
{
#ifdef DEBUG_TRACE
std::cerr << " map on a square" << std::endl;
#endif
// Nothing to do if no border
if (mesh.mesh_main_border_vertices_begin() == mesh.mesh_main_border_vertices_end())
return Parameterizer_traits_3<Adaptor>::ERROR_BORDER_TOO_SHORT;
// Compute the total border length
double total_len = compute_border_length(mesh);
if (total_len == 0)
return Parameterizer_traits_3<Adaptor>::ERROR_BORDER_TOO_SHORT;
// map to [0,4[
double len = 0.0; // current position on square in [0, total_len[
Offset_map offset; // vertex index -> offset map
offset.resize(mesh.count_mesh_vertices());
Border_vertex_iterator it;
for(it = mesh.mesh_main_border_vertices_begin();
it != mesh.mesh_main_border_vertices_end();
it++)
{
CGAL_surface_mesh_parameterization_assertion(mesh.is_vertex_on_main_border(it));
offset[mesh.get_vertex_index(it)] = 4.0f*len/total_len;
// current position on square in [0,4[
// Get next iterator (looping)
Border_vertex_iterator next = it;
next++;
if(next == mesh.mesh_main_border_vertices_end())
next = mesh.mesh_main_border_vertices_begin();
// Add edge "length" to 'len'
len += compute_edge_length(mesh, it, next);
}
// First square corner is mapped to first vertex.
// Then find closest points for three other corners.
Border_vertex_iterator it0 = mesh.mesh_main_border_vertices_begin();
Border_vertex_iterator it1 = closest_iterator(mesh, offset, 1.0);
Border_vertex_iterator it2 = closest_iterator(mesh, offset, 2.0);
Border_vertex_iterator it3 = closest_iterator(mesh, offset, 3.0);
//
// We may get into trouble if the border is too short
if (it0 == it1 || it1 == it2 || it2 == it3 || it3 == it0)
return Parameterizer_traits_3<Adaptor>::ERROR_BORDER_TOO_SHORT;
//
// Snap these vertices to corners
offset[mesh.get_vertex_index(it0)] = 0.0;
offset[mesh.get_vertex_index(it1)] = 1.0;
offset[mesh.get_vertex_index(it2)] = 2.0;
offset[mesh.get_vertex_index(it3)] = 3.0;
// Set vertices along square's sides and mark them as "parameterized"
for(it = it0; it != it1; it++) // 1st side
{
Point_2 uv(offset[mesh.get_vertex_index(it)], 0.0);
mesh.set_vertex_uv(it, uv);
mesh.set_vertex_parameterized(it, true);
}
for(it = it1; it != it2; it++) // 2nd side
{
Point_2 uv(1.0, offset[mesh.get_vertex_index(it)]-1);
mesh.set_vertex_uv(it, uv);
mesh.set_vertex_parameterized(it, true);
}
for(it = it2; it != it3; it++) // 3rd side
{
Point_2 uv(3-offset[mesh.get_vertex_index(it)], 1.0);
mesh.set_vertex_uv(it, uv);
mesh.set_vertex_parameterized(it, true);
}
for(it = it3; it != mesh.mesh_main_border_vertices_end(); it++) // 4th side
{
Point_2 uv(0.0, 4-offset[mesh.get_vertex_index(it)]);
mesh.set_vertex_uv(it, uv);
mesh.set_vertex_parameterized(it, true);
}
return Parameterizer_traits_3<Adaptor>::OK;
}
// Utility method for parameterize_border().
// Compute mesh iterator whose offset is closest to 'value'.
template<class Adaptor>
inline
typename Adaptor::Border_vertex_iterator
Square_border_parameterizer_3<Adaptor>::closest_iterator(Adaptor& mesh,
const Offset_map& offset,
double value)
{
Border_vertex_iterator best;
double min = DBL_MAX; // distance for 'best'
for (Border_vertex_iterator it = mesh.mesh_main_border_vertices_begin();
it != mesh.mesh_main_border_vertices_end();
it++)
{
double d = CGAL::abs(offset[mesh.get_vertex_index(it)] - value);
if (d < min)
{
best = it;
min = d;
}
}
return best;
}
//
// Class Square_border_uniform_parameterizer_3
//
/// This class parameterizes the border of a 3D surface onto a square
/// in a uniform manner: points are equally spaced.
///
/// Square_border_parameterizer_3 implements most of the border parameterization
/// algorithm. This class implements only compute_edge_length() to compute a
/// segment's length.
///
/// @heading Is Model for the Concepts: Model of the BorderParameterizer_3 concept.
///
/// @heading Design Pattern:
/// BorderParameterizer_3 models are Strategies [GHJV95]: they implement
/// a strategy of border parameterization for models of ParameterizationMesh_3.
template<class ParameterizationMesh_3> //< 3D surface
class Square_border_uniform_parameterizer_3
: public Square_border_parameterizer_3<ParameterizationMesh_3>
{
// Public types
public:
// We have to repeat the types exported by superclass
/// @cond SKIP_IN_MANUAL
typedef ParameterizationMesh_3 Adaptor;
/// @endcond
// Private types
private:
// Mesh_Adaptor_3 subtypes:
typedef typename Adaptor::NT NT;
typedef typename Adaptor::Point_2 Point_2;
typedef typename Adaptor::Point_3 Point_3;
typedef typename Adaptor::Vector_2 Vector_2;
typedef typename Adaptor::Vector_3 Vector_3;
typedef typename Adaptor::Facet Facet;
typedef typename Adaptor::Facet_handle Facet_handle;
typedef typename Adaptor::Facet_const_handle
Facet_const_handle;
typedef typename Adaptor::Facet_iterator Facet_iterator;
typedef typename Adaptor::Facet_const_iterator
Facet_const_iterator;
typedef typename Adaptor::Vertex Vertex;
typedef typename Adaptor::Vertex_handle Vertex_handle;
typedef typename Adaptor::Vertex_const_handle
Vertex_const_handle;
typedef typename Adaptor::Vertex_iterator Vertex_iterator;
typedef typename Adaptor::Vertex_const_iterator
Vertex_const_iterator;
typedef typename Adaptor::Border_vertex_iterator
Border_vertex_iterator;
typedef typename Adaptor::Border_vertex_const_iterator
Border_vertex_const_iterator;
typedef typename Adaptor::Vertex_around_facet_circulator
Vertex_around_facet_circulator;
typedef typename Adaptor::Vertex_around_facet_const_circulator
Vertex_around_facet_const_circulator;
typedef typename Adaptor::Vertex_around_vertex_circulator
Vertex_around_vertex_circulator;
typedef typename Adaptor::Vertex_around_vertex_const_circulator
Vertex_around_vertex_const_circulator;
// Public operations
public:
// Default constructor, copy constructor and operator =() are fine
// Protected operations
protected:
/// Compute the length of an edge.
virtual double compute_edge_length(const Adaptor& /* mesh */,
Vertex_const_handle /* source */,
Vertex_const_handle /* target */)
{
/// Uniform border parameterization: points are equally spaced.
return 1;
}
};
//
// Class Square_border_arc_length_parameterizer_3
//
/// This class parameterizes the border of a 3D surface onto a square,
/// with an arc-length parameterization: (u,v) values are
/// proportional to the length of border edges.
///
/// Square_border_parameterizer_3 implements most of the border parameterization
/// algorithm. This class implements only compute_edge_length() to compute a
/// segment's length.
///
/// @heading Is Model for the Concepts: Model of the BorderParameterizer_3 concept.
///
/// @heading Design Pattern:
/// BorderParameterizer_3 models are Strategies [GHJV95]: they implement
/// a strategy of border parameterization for models of ParameterizationMesh_3
template<class ParameterizationMesh_3> //< 3D surface
class Square_border_arc_length_parameterizer_3
: public Square_border_parameterizer_3<ParameterizationMesh_3>
{
// Public types
public:
// We have to repeat the types exported by superclass
/// @cond SKIP_IN_MANUAL
typedef ParameterizationMesh_3 Adaptor;
/// @endcond
// Private types
private:
// Mesh_Adaptor_3 subtypes:
typedef typename Adaptor::NT NT;
typedef typename Adaptor::Point_2 Point_2;
typedef typename Adaptor::Point_3 Point_3;
typedef typename Adaptor::Vector_2 Vector_2;
typedef typename Adaptor::Vector_3 Vector_3;
typedef typename Adaptor::Facet Facet;
typedef typename Adaptor::Facet_handle Facet_handle;
typedef typename Adaptor::Facet_const_handle
Facet_const_handle;
typedef typename Adaptor::Facet_iterator Facet_iterator;
typedef typename Adaptor::Facet_const_iterator
Facet_const_iterator;
typedef typename Adaptor::Vertex Vertex;
typedef typename Adaptor::Vertex_handle Vertex_handle;
typedef typename Adaptor::Vertex_const_handle
Vertex_const_handle;
typedef typename Adaptor::Vertex_iterator Vertex_iterator;
typedef typename Adaptor::Vertex_const_iterator
Vertex_const_iterator;
typedef typename Adaptor::Border_vertex_iterator
Border_vertex_iterator;
typedef typename Adaptor::Border_vertex_const_iterator
Border_vertex_const_iterator;
typedef typename Adaptor::Vertex_around_facet_circulator
Vertex_around_facet_circulator;
typedef typename Adaptor::Vertex_around_facet_const_circulator
Vertex_around_facet_const_circulator;
typedef typename Adaptor::Vertex_around_vertex_circulator
Vertex_around_vertex_circulator;
typedef typename Adaptor::Vertex_around_vertex_const_circulator
Vertex_around_vertex_const_circulator;
// Public operations
public:
// Default constructor, copy constructor and operator =() are fine
// Protected operations
protected:
/// Compute the length of an edge.
virtual double compute_edge_length(const Adaptor& mesh,
Vertex_const_handle source,
Vertex_const_handle target)
{
/// Arc-length border parameterization: (u,v) values are
/// proportional to the length of border edges.
Vector_3 v = mesh.get_vertex_position(target)
- mesh.get_vertex_position(source);
return std::sqrt(v*v);
}
};
} //namespace CGAL
#endif //CGAL_SQUAREBORDERPARAMETERIZER_3_H
|
