map2.h 17.4 KB
Newer Older
Pierre Kraemer's avatar
Pierre Kraemer committed
1
2
3
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
4
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg           *
Pierre Kraemer's avatar
Pierre Kraemer committed
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
*                                                                              *
* This library is free software; 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; either version 2.1 of the License, or (at your     *
* option) any later version.                                                   *
*                                                                              *
* This library is distributed in the hope that it will be useful, but WITHOUT  *
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or        *
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License  *
* for more details.                                                            *
*                                                                              *
* You should have received a copy of the GNU Lesser General Public License     *
* along with this library; if not, write to the Free Software Foundation,      *
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301 USA.           *
*                                                                              *
20
* Web site: http://cgogn.unistra.fr/                                           *
Pierre Kraemer's avatar
Pierre Kraemer committed
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
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#ifndef __MAP2_H__
#define __MAP2_H__

#include "Topology/map/map1.h"

namespace CGoGN
{

/*! \brief The class of dual 2-dimensional combinatorial maps:
 *  set of oriented faces pairwise sewed by an adjacency relation.
 *  A dual 2-map represents close or open oriented 2-manifolds (surfaces).
 *  - A dual 2-map is made of darts linked by the phi1 permutation
 * 	and/or the phi2 one-to-one relation.
 *  - In this class darts are interpreted as oriented edges.
 *  - The phi1 relation defines oriented faces (see Map1)
 *  and faces may have arbitrary size (degenerated faces are accepted).
 *  - The phi2 relation links oriented faces along oriented edges.
 *  A set of phi2-linked faces represents a surface 
 *  - Edges that have no phi2-link are border edges. If there exists
 *  such edges the map is open.
 *  - When every edge is phi2-linked, the map is closed. In this case
 *  some optimizations are enabled that speed up the processing of vertices.
 */
48
49
template <class MAP>
class Map2 : public Map1<MAP>
Pierre Kraemer's avatar
Pierre Kraemer committed
50
{
51
protected:
52
53
	void init() ;

Pierre Kraemer's avatar
Pierre Kraemer committed
54
public:
55
	typedef Map1<MAP> ParentMap;
Pierre Kraemer's avatar
Pierre Kraemer committed
56

Pierre Kraemer's avatar
Pierre Kraemer committed
57
	inline static unsigned int ORBIT_IN_PARENT(unsigned int o) { return o+5; }
58

Pierre Kraemer's avatar
Pierre Kraemer committed
59
60
	static const unsigned int IN_PARENT = 5 ;

61
62
63
	static const unsigned int VERTEX_OF_PARENT = VERTEX+5;
	static const unsigned int EDGE_OF_PARENT = EDGE+5;

Pierre Kraemer's avatar
Pierre Kraemer committed
64
65
	static const unsigned int DIMENSION = 2 ;

Pierre Kraemer's avatar
Pierre Kraemer committed
66
67
	Map2();

68
	virtual std::string mapTypeName() const;
Pierre Kraemer's avatar
Pierre Kraemer committed
69

70
	virtual unsigned int dimension() const;
Pierre Kraemer's avatar
Pierre Kraemer committed
71

72
73
	virtual void clear(bool removeAttrib);

Sylvain Thery's avatar
Sylvain Thery committed
74
75
	virtual void update_topo_shortcuts();

Pierre Kraemer's avatar
Pierre Kraemer committed
76
77
78
79
	/*! @name Basic Topological Operators
	 * Access and Modification
	 *************************************************************************/

Sylvain Thery's avatar
Sylvain Thery committed
80
	Dart phi2(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
81
82

	template <int N>
Sylvain Thery's avatar
Sylvain Thery committed
83
	Dart phi(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
84

Sylvain Thery's avatar
Sylvain Thery committed
85
	Dart alpha0(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
86

Sylvain Thery's avatar
Sylvain Thery committed
87
	Dart alpha1(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
88

Sylvain Thery's avatar
Sylvain Thery committed
89
	Dart alpha_1(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
90

91
92
93
	/**
	 * prefer phi2_1 to alpha1 in algo if your want it to work in Map2 of Map3
	 */
Sylvain Thery's avatar
Sylvain Thery committed
94
	Dart phi2_1(Dart d) const;
95
96
97
98

	/**
	 * prefer phi21 to alpha_1 in algo if your want it to work in Map2 of Map3
	 */
Sylvain Thery's avatar
Sylvain Thery committed
99
	Dart phi12(Dart d) const;
100

Pierre Kraemer's avatar
Pierre Kraemer committed
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
protected:
	//! Link dart d with dart e by an involution
	/*  @param d,e the darts to link
	 *	- Before:	d->d and e->e
	 *	- After:	d->e and e->d
	 */
	void phi2sew(Dart d, Dart e);

	//! Unlink the current dart by an involution
	/*  @param d the dart to unlink
	 * - Before:	d->e and e->d
	 * - After:		d->d and e->e
	 */
	void phi2unsew(Dart d);

116
public:
117
//	void rdfi(Dart t, DartMarker& m1, DartMarker& m2);
118

untereiner's avatar
untereiner committed
119
120
121

	//void propagateDartRelation(Dart d) ;

Pierre Kraemer's avatar
Pierre Kraemer committed
122
123
124
125
126
	/*! @name Generator and Deletor
	 *  To generate or delete faces in a 2-map
	 *************************************************************************/

	//@{
127
	//! Create an new polyline of nbEdges, i.e 2*nbEdges darts pairwise sewn by phi2
David Cazier's avatar
David Cazier committed
128
129
130
131
132
	/*! @param nbEdges the number of edges
	 *  @return return a dart of the face
	 */
	virtual Dart newPolyLine(unsigned int nbEdges) ;

133
134
	//! Create an new face of nbEdges
	/*! @param nbEdges the number of edges
135
	 *  @param withBoundary create the face and its boundary (default true)
136
137
	 *  @return return a dart of the face
	 */
138
	virtual Dart newFace(unsigned int nbEdges, bool withBoundary = true) ;
139

140
141
	//! Delete the face of d
	/*! @param d a dart of the face
142
	 *  @param withBoundary create or extend boundary face instead of fixed points (default true)
143
	 */
144
	virtual void deleteFace(Dart d, bool withBoundary = true) ;
145

untereiner's avatar
untereiner committed
146
147
148
149
150
	//! Delete a connected component of the map
	/*! @param d a dart of the connected component
	 */
	virtual void deleteCC(Dart d) ;

151
152
153
154
155
	//! Fill a hole with a face
	/*! \pre Dart d is boundary marked
	 *  @param d a dart of the face to fill
	 */
	virtual void fillHole(Dart d) ;
156
157
158
159
160
161

	//! Open the mesh Transforming a face in a hole
	/*! \pre Dart d is NOT boundary marked
	 *  @param d a dart of the face filled
	 */
	virtual void createHole(Dart d) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
162
163
164
165
166
167
168
169
170
171
172
173
174
175
	//@}

	/*! @name Topological Operators
	 *  Topological operations on 2-maps
	 *************************************************************************/

	//@{
	//! Split a vertex v between d and e inserting an edge after d and e
	/*! \pre Darts d & e MUST belong to the same vertex
	 *  @param d first dart in vertex v
	 *  @param e second dart in vertex v
	 */
	virtual void splitVertex(Dart d, Dart e);

Pierre Kraemer's avatar
Pierre Kraemer committed
176
	//! Delete the vertex of d (works only for internal vertices)
Pierre Kraemer's avatar
Pierre Kraemer committed
177
178
	/*! Does not create a hole -> all the faces
	 * 	around the vertex are merged into one face
Pierre Kraemer's avatar
Pierre Kraemer committed
179
	 *  @param d a dart of the vertex to delete
180
	 *  @return a dart of the resulting face (NIL if the deletion has not been executed)
Pierre Kraemer's avatar
Pierre Kraemer committed
181
	 */
182
	virtual Dart deleteVertex(Dart d);
Pierre Kraemer's avatar
Pierre Kraemer committed
183

Pierre Kraemer's avatar
Pierre Kraemer committed
184
	//! Cut the edge of d by inserting a new vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
185
	/*! @param d a dart of the edge to cut
Pierre Kraemer's avatar
Pierre Kraemer committed
186
	 *  @return a dart of the new vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
187
	 */
David Cazier's avatar
David Cazier committed
188
	virtual Dart cutEdge(Dart d);
Pierre Kraemer's avatar
Pierre Kraemer committed
189

Pierre Kraemer's avatar
Pierre Kraemer committed
190
	//! Undo the cut of the edge of d
Pierre Kraemer's avatar
Pierre Kraemer committed
191
	/*! @param d a dart of the edge to uncut
192
	 *  @return true if the uncut has been executed, false otherwise
Pierre Kraemer's avatar
Pierre Kraemer committed
193
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
194
	virtual bool uncutEdge(Dart d);
Pierre Kraemer's avatar
Pierre Kraemer committed
195

Pierre Kraemer's avatar
Pierre Kraemer committed
196
197
	//! Collapse an edge (that is deleted) possibly merging its vertices
	/*! If delDegenerateFaces is true, the method checks that no degenerate
198
	 *  faces are built (faces with less than 3 edges). If it occurs the faces
Pierre Kraemer's avatar
Pierre Kraemer committed
199
200
201
202
203
	 *  are deleted and the adjacencies are updated (see collapseDegeneratedFace).
	 *  \warning This may produce two distinct vertices if the edge
	 *  was the only link between two border faces
	 *  @param d a dart in the deleted edge
	 *  @param delDegenerateFaces a boolean (default to true)
204
	 *  @return a dart of the resulting vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
205
	 */
206
	virtual Dart collapseEdge(Dart d, bool delDegenerateFaces = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
207
208

	/**
209
	 * Flip the edge of d (rotation in phi1 order)
210
	 * WARNING : Works only for non-border edges
Pierre Kraemer's avatar
Pierre Kraemer committed
211
212
213
214
215
216
	 * @param d a dart of the edge to flip
	 * @return true if the flip has been executed, false otherwise
	 */
	virtual bool flipEdge(Dart d);

	/**
217
	 * Flip the edge of d (rotation in phi_1 order)
218
	 * WARNING : Works only for non-border edges
Pierre Kraemer's avatar
Pierre Kraemer committed
219
	 * @param d a dart of the edge to flip
Pierre Kraemer's avatar
Pierre Kraemer committed
220
	 * @return true if the flipBack has been executed, false otherwise
Pierre Kraemer's avatar
Pierre Kraemer committed
221
222
223
	 */
	virtual bool flipBackEdge(Dart d);

untereiner's avatar
untereiner committed
224
225
226
227
228
229
	//!
	/*!
	 *
	 */
	void swapEdges(Dart d, Dart e);

230
231
232
	 //	 *  @param d dart of the vertex
	 //	 *  @param e dart of the edge
	 //	 */
233
	virtual void insertEdgeInVertex(Dart d, Dart e);
234
235
236
237
238
239
	 //
	 //	//! Remove an edge from a vertex orbit
	 //	/*! \pre Dart d must be phi2 sewed
	 //	 *  @param d the dart of the edge to remove from the vertex
	 //	 * @return true if the removal has been executed, false otherwise
	 //	 */
240
	virtual bool removeEdgeFromVertex(Dart d);
241

Pierre Kraemer's avatar
Pierre Kraemer committed
242
	//! Sew two oriented faces along oriented edges
Pierre Kraemer's avatar
Pierre Kraemer committed
243
	/*! \pre Edges of darts d & e MUST be boundary edges
Pierre Kraemer's avatar
Pierre Kraemer committed
244
245
	 *  @param d a dart of the first face
	 *  @param e a dart of the second face
246
	 *  @param withBoundary: if false, faces must have phi2 fixed points (only for construction: import/primitives)
Pierre Kraemer's avatar
Pierre Kraemer committed
247
	 */
248
	virtual void sewFaces(Dart d, Dart e, bool withBoundary = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
249

250
251
252
	//! Unsew two oriented faces
	/*! \pre Edge of dart d MUST NOT be a boundary edge
	 *  @param d a dart of a face
Pierre Kraemer's avatar
Pierre Kraemer committed
253
	 */
254
	virtual void unsewFaces(Dart d, bool withBoundary = true);
Sylvain Thery's avatar
Sylvain Thery committed
255

Pierre Kraemer's avatar
Pierre Kraemer committed
256
	//! Delete an oriented face if and only if it has one or two edges
257
258
	/*! If the face is sewed to two distinct adjacent faces,
	 *  then those two faces are sewed
Pierre Kraemer's avatar
Pierre Kraemer committed
259
260
261
262
263
264
265
266
267
268
269
270
271
	 *  @param d a dart of the face
	 *  @return true if the collapse has been executed, false otherwise
	 */
	virtual bool collapseDegeneratedFace(Dart d);

	//! Split a face f between d and e inserting an edge between vertices d & e
	/*! \pre Darts d & e MUST belong to the same face
	 *  @param d first dart in face f
	 *  @param e second dart in face f
	 */
	virtual void splitFace(Dart d, Dart e);

	//! Merge the two faces incident to the edge of d.
272
273
	/*! Works only for non-boundary edges.
	 *  \warning Darts of the edge of d no longer exist after the call
Pierre Kraemer's avatar
Pierre Kraemer committed
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
	 *  @param d a dart in the first face
	 *  @return true if the merge has been executed, false otherwise
	 */
	virtual bool mergeFaces(Dart d);

	/**
	 * Extract a pair of sewed triangles and sew their adjacent faces
	 * d is a dart of the common edge of the pair of triangles
	 */
	void extractTrianglePair(Dart d) ;

	/**
	 * Insert a pair of sewed triangles in a vertex by exploding the edges of v1 and v2
	 * v1 and v2 belong to the same vertex
	 * d is a dart of the common edge of the pair of triangles
	 */
	void insertTrianglePair(Dart d, Dart v1, Dart v2) ;

	//! Merge two volumes along two faces.
	/*! Works only if the two faces have the same number of edges.
294
	 *  The faces adjacent to the two given faces are pairwise sewed
Pierre Kraemer's avatar
Pierre Kraemer committed
295
296
297
298
299
300
301
	 *  then the 2 faces are deleted.
	 *  If the two faces belong to different surfaces, the surfaces are merged,
	 *  else a handle is created that increases the genus of the surface.
	 *  @param d a dart of the first face
	 *  @param e a dart of the second face
	 *  @return true if the merge has been executed, false otherwise
	 */
302
	virtual bool mergeVolumes(Dart d, Dart e, bool deleteFace = true);
303
304
305

	//! Split a surface into two disconnected surfaces along a edge path
	/*! @param vd a vector of darts
306
307
	 *  @param firstSideOpen : if false, one of the 2 sides of the surface remains closed (no hole)
	 *  @param secondSideOpen : if false, the other side of the surface remains closed (no hole)
308
	 */
309
	virtual void splitSurface(std::vector<Dart>& vd, bool firstSideClosed = true, bool secondSideClosed = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
310
311
312
313
314
315
316
317
318
319
320
	//@}

	/*! @name Topological Queries
	 *  Return or set various topological information
	 *************************************************************************/

	//@{
	//! Test if dart d and e belong to the same oriented vertex
	/*! @param d a dart
	 *  @param e a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
321
	bool sameOrientedVertex(Dart d, Dart e) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
322

323
324
325
326
	//! Test if dart d and e belong to the same vertex
	/*! @param d a dart
	 *  @param e a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
327
	bool sameVertex(Dart d, Dart e) const;
328
329
330
331

	//! Compute the number of edges of the vertex of d
	/*! @param d a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
332
	unsigned int vertexDegree(Dart d) const;
333

334
335
336
337
338
	//! Check number of edges of the vertex of d with given parameter
	/*! @param d a dart
	 *	@param vd degree to compare with
	 *  @return  negative/null/positive if vertex degree is less/equal/greater than given degree
	 */
Sylvain Thery's avatar
Sylvain Thery committed
339
	int checkVertexDegree(Dart d, unsigned int vd) const;
340

341
342
343
	//! Tell if the vertex of d is on the boundary of the map
	/*! @param d a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
344
	bool isBoundaryVertex(Dart d) const;
345

Pierre Kraemer's avatar
Pierre Kraemer committed
346
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
347
348
	 * find the dart of vertex that belong to the boundary
	 * return NIL if the vertex is not on the boundary
Pierre Kraemer's avatar
Pierre Kraemer committed
349
	 */
Sylvain Thery's avatar
Sylvain Thery committed
350
	Dart findBoundaryEdgeOfVertex(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
351

Pierre Kraemer's avatar
Pierre Kraemer committed
352
353
354
	//! Test if dart d and e belong to the same edge
	/*! @param d a dart
	 *  @param e a dart
355
	 */
Sylvain Thery's avatar
Sylvain Thery committed
356
	bool sameEdge(Dart d, Dart e) const;
357

Pierre Kraemer's avatar
Pierre Kraemer committed
358
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
359
	 * tell if the edge of d is on the boundary of the map
Pierre Kraemer's avatar
Pierre Kraemer committed
360
	 */
Sylvain Thery's avatar
Sylvain Thery committed
361
	bool isBoundaryEdge(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
362

untereiner's avatar
bla    
untereiner committed
363
	//! Test if dart d and e belong to the same oriented face
untereiner's avatar
untereiner committed
364
365
366
	/*! @param d a dart
	 *  @param e a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
367
	bool sameOrientedFace(Dart d, Dart e) const;
untereiner's avatar
untereiner committed
368

Pierre Kraemer's avatar
Pierre Kraemer committed
369
370
371
372
	//! Test if dart d and e belong to the same face
	/*! @param d a dart
	 *  @param e a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
373
	bool sameFace(Dart d, Dart e) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
374

375
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
376
	 * compute the number of edges of the face of d
377
	 */
Sylvain Thery's avatar
Sylvain Thery committed
378
	unsigned int faceDegree(Dart d) const;
Sylvain Thery's avatar
Sylvain Thery committed
379

380
381
382
383
384
	//! Check number of edges of the face of d with given parameter
	/*! @param d a dart
	 *	@param vd degree to compare with
	 *  @return  negative/null/positive if vertex degree is less/equal/greater than given degree
	 */
Sylvain Thery's avatar
Sylvain Thery committed
385
	int checkFaceDegree(Dart d, unsigned int le) const;
386

Pierre Kraemer's avatar
Pierre Kraemer committed
387
388
389
	/**
	 * tell if the face of d is on the boundary of the map
	 */
Sylvain Thery's avatar
Sylvain Thery committed
390
	bool isBoundaryFace(Dart d) const;
391

392
393
394
395
396
397
	/**
	 * find the dart of edge that belong to the boundary
	 * return NIL if the face is not on the boundary
	 */
	Dart findBoundaryEdgeOfFace(Dart d) const;

398
	//! Test if dart d and e belong to the same oriented volume
Pierre Kraemer's avatar
Pierre Kraemer committed
399
400
401
	/*! @param d a dart
	 *  @param e a dart
	 */
Sylvain Thery's avatar
Sylvain Thery committed
402
	bool sameOrientedVolume(Dart d, Dart e) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
403

404
	//! Test if dart d and e belong to the same volume
405
	/*! @param d a dart
406
	 *  @param e a dart
Pierre Kraemer's avatar
Pierre Kraemer committed
407
	 */
Sylvain Thery's avatar
Sylvain Thery committed
408
	bool sameVolume(Dart d, Dart e) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
409

410
411
	//! Compute the number of faces in the volume of d
	/*! @param d a dart
Pierre Kraemer's avatar
Pierre Kraemer committed
412
	 */
Sylvain Thery's avatar
Sylvain Thery committed
413
	unsigned int volumeDegree(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
414

415
416
417
418
419
	//! Check number of faces of the volume of d with given parameter
	/*! @param d a dart
	 *	@param vd degree to compare with
	 *  @return  negative/null/positive if volume degree is less/equal/greater than given degree
	 */
Sylvain Thery's avatar
Sylvain Thery committed
420
	int checkVolumeDegree(Dart d, unsigned int volDeg)const;
421

Pierre Kraemer's avatar
Pierre Kraemer committed
422
423
424
425
426
	// TODO a mettre en algo
	/**
	 * check if the mesh is triangular or not
	 * @return a boolean indicating if the mesh is triangular
	 */
Sylvain Thery's avatar
Sylvain Thery committed
427
	bool isTriangular() const;
Pierre Kraemer's avatar
Pierre Kraemer committed
428

Pierre Kraemer's avatar
Pierre Kraemer committed
429
	// TODO a mettre en algo
Pierre Kraemer's avatar
Pierre Kraemer committed
430
431
	/**
	 * Check if map is complete
Pierre Kraemer's avatar
Pierre Kraemer committed
432
	 * Should be executed after import
Pierre Kraemer's avatar
Pierre Kraemer committed
433
	 */
Sylvain Thery's avatar
Sylvain Thery committed
434
	virtual bool check() const;
untereiner's avatar
untereiner committed
435
436
437
438
439

	/**
	 * Check if a serie of darts is an oriented simple close path
	 */
	virtual bool checkSimpleOrientedPath(std::vector<Dart>& vd);
Pierre Kraemer's avatar
Pierre Kraemer committed
440
441
442
443
444
445
	//@}

	/*! @name Cell Functors
	 *  Apply functors to all darts of a cell
	 *************************************************************************/

446
	//@{
Pierre Kraemer's avatar
Pierre Kraemer committed
447
448
449
450
	//! Apply a functor on every dart of a vertex
	/*! @param d a dart of the vertex
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
451
	bool foreach_dart_of_vertex(Dart d, FunctorType& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
452

untereiner's avatar
untereiner committed
453
	//! Apply a functor on every dart of an edge
Pierre Kraemer's avatar
Pierre Kraemer committed
454
455
456
	/*! @param d a dart of the edge
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
457
	bool foreach_dart_of_edge(Dart d, FunctorType& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
458

459
	//! Apply a functor on every dart of an face
460
461
462
	/*! @param d a dart of the volume
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
463
	bool foreach_dart_of_face(Dart d, FunctorType& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
464

Pierre Kraemer's avatar
Pierre Kraemer committed
465
466
467
468
	//! Apply a functor on every dart of an face
	/*! @param d a dart of the volume
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
469
	bool foreach_dart_of_volume(Dart d, FunctorType& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
470

Pierre Kraemer's avatar
Pierre Kraemer committed
471
472
473
474
	//! Apply a functor on every dart of a connected component
	/*! @param d a dart of the connected component
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
475
	bool foreach_dart_of_cc(Dart d, FunctorType& f, unsigned int thread = 0) const;
476
477
478
479
480

	//! Apply a functor on every dart of a vertex of map1 representing the face of d
	/*! @param d a dart of the vertex
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
481
	bool foreach_dart_of_vertex1(Dart d, FunctorType& f, unsigned int thread = 0) const;
482
483
484
485
486

	//! Apply a functor on every dart of an edge of map1 representing the face of d
	/*! @param d a dart of the edge
	 *  @param f the functor to apply
	 */
Sylvain Thery's avatar
Sylvain Thery committed
487
	bool foreach_dart_of_edge1(Dart d, FunctorType& f, unsigned int thread = 0) const;
488

Pierre Kraemer's avatar
Pierre Kraemer committed
489
	//@}
Sylvain Thery's avatar
Sylvain Thery committed
490

Pierre Kraemer's avatar
Pierre Kraemer committed
491
492
493
494
	/*! @name Close map after import or creation
	 *  These functions must be used with care, generally only by import algorithms
	 *************************************************************************/

Sylvain Thery's avatar
Sylvain Thery committed
495
	//@{
496
497
498
499
500
	/**
	 * create a face of map1 marked as boundary
	 */
	Dart newBoundaryCycle(unsigned int nbE);

501
	//! Close a topological hole (a sequence of connected fixed point of phi2). DO NOT USE, only for import/creation algorithm
Sylvain Thery's avatar
Sylvain Thery committed
502
503
504
	/*! \pre dart d MUST be fixed point of phi2 relation
	 *  Add a face to the map that closes the hole.
	 *  @param d a dart of the hole (with phi2(d)==d)
505
	 *  @param forboundary tag the created face as boundary (default is true)
Sylvain Thery's avatar
Sylvain Thery committed
506
507
	 *  @return the degree of the created face
	 */
508
	virtual unsigned int closeHole(Dart d, bool forboundary = true);
Sylvain Thery's avatar
Sylvain Thery committed
509

510
	//! Close the map removing topological holes: DO NOT USE, only for import/creation algorithm
Sylvain Thery's avatar
Sylvain Thery committed
511
	/*! Add faces to the map that close every existing hole.
512
	 *  These faces are marked as boundary.
513
	 *  @return the number of closed holes
Sylvain Thery's avatar
Sylvain Thery committed
514
	 */
515
	unsigned int closeMap(bool forboundary = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
516
	//@}
untereiner's avatar
untereiner committed
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533


	/*! @name Compute dual
	 * These functions compute the dual mesh
	 *************************************************************************/

	//@{
	//! Reverse the orientation of the map
	/*!
	 */
	void reverseOrientation();

	//! Dual mesh computation (open or closed)
	/*! Crop the infinite faces of open meshes
	 */
	void computeDual();
	//@}
Pierre Kraemer's avatar
Pierre Kraemer committed
534
535
536
537
538
539
540
};

} // namespace CGoGN

#include "Topology/map/map2.hpp"

#endif