map2.h 17.3 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.
 */
Pierre Kraemer's avatar
Pierre Kraemer committed
48 49
template <typename MAP_IMPL>
class Map2 : public Map1<MAP_IMPL>
Pierre Kraemer's avatar
Pierre Kraemer committed
50
{
51
protected:
52 53
	void init() ;

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

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

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

62 63 64
	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
65 66
	static const unsigned int DIMENSION = 2 ;

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

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

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

73 74
	virtual void clear(bool removeAttrib);

Pierre Kraemer's avatar
Pierre Kraemer committed
75 76
	virtual unsigned int getNbInvolutions() const;
	virtual unsigned int getNbPermutations() const;
Sylvain Thery's avatar
Sylvain Thery committed
77

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

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

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

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

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

Sylvain Thery's avatar
Sylvain Thery committed
91
	Dart alpha_1(Dart d) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
92

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

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

Pierre Kraemer's avatar
Pierre Kraemer committed
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
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);

118
public:
Pierre Kraemer's avatar
Pierre Kraemer committed
119 120 121 122 123
	/*! @name Generator and Deletor
	 *  To generate or delete faces in a 2-map
	 *************************************************************************/

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

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

137 138
	//! Delete the face of d
	/*! @param d a dart of the face
139
	 *  @param withBoundary create or extend boundary face instead of fixed points (default true)
140
	 */
141
	void deleteFace(Dart d) ;
142

untereiner's avatar
untereiner committed
143 144 145
	//! Delete a connected component of the map
	/*! @param d a dart of the connected component
	 */
146
	void deleteCC(Dart d) ;
untereiner's avatar
untereiner committed
147

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

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

	/*! @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
	 */
171
	void splitVertex(Dart d, Dart e);
Pierre Kraemer's avatar
Pierre Kraemer committed
172

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

Pierre Kraemer's avatar
Pierre Kraemer committed
181
	//! Cut the edge of d by inserting a new vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
182
	/*! @param d a dart of the edge to cut
Pierre Kraemer's avatar
Pierre Kraemer committed
183
	 *  @return a dart of the new vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
184
	 */
185
	Dart cutEdge(Dart d);
Pierre Kraemer's avatar
Pierre Kraemer committed
186

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

193
	//! Collapse an edge (that is deleted) by merging its vertices
Pierre Kraemer's avatar
Pierre Kraemer committed
194
	/*! If delDegenerateFaces is true, the method checks that no degenerate
195
	 *  faces are built (faces with less than 3 edges). If it occurs the faces
Pierre Kraemer's avatar
Pierre Kraemer committed
196 197 198
	 *  are deleted and the adjacencies are updated (see collapseDegeneratedFace).
	 *  @param d a dart in the deleted edge
	 *  @param delDegenerateFaces a boolean (default to true)
199
	 *  @return a dart of the resulting vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
200
	 */
201
	Dart collapseEdge(Dart d, bool delDegenerateFaces = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
202 203

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

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

untereiner's avatar
untereiner committed
219 220 221 222 223 224
	//!
	/*!
	 *
	 */
	void swapEdges(Dart d, Dart e);

225 226 227
	 //	 *  @param d dart of the vertex
	 //	 *  @param e dart of the edge
	 //	 */
228
	void insertEdgeInVertex(Dart d, Dart e);
229 230 231 232 233 234
	 //
	 //	//! 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
	 //	 */
235
	bool removeEdgeFromVertex(Dart d);
236

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

245 246 247
	//! 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
248
	 */
249
	virtual void unsewFaces(Dart d, bool withBoundary = true);
Sylvain Thery's avatar
Sylvain Thery committed
250

Pierre Kraemer's avatar
Pierre Kraemer committed
251
	//! Delete an oriented face if and only if it has one or two edges
252 253
	/*! If the face is sewed to two distinct adjacent faces,
	 *  then those two faces are sewed
Pierre Kraemer's avatar
Pierre Kraemer committed
254 255 256 257 258 259 260 261 262 263
	 *  @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
	 */
264
	void splitFace(Dart d, Dart e);
Pierre Kraemer's avatar
Pierre Kraemer committed
265 266

	//! Merge the two faces incident to the edge of d.
267 268
	/*! 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
269 270 271
	 *  @param d a dart in the first face
	 *  @return true if the merge has been executed, false otherwise
	 */
272
	bool mergeFaces(Dart d);
Pierre Kraemer's avatar
Pierre Kraemer committed
273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288

	/**
	 * 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.
289
	 *  The faces adjacent to the two given faces are pairwise sewed
Pierre Kraemer's avatar
Pierre Kraemer committed
290 291 292 293 294 295 296
	 *  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
	 */
297
	bool mergeVolumes(Dart d, Dart e, bool deleteFace = true);
298 299 300

	//! Split a surface into two disconnected surfaces along a edge path
	/*! @param vd a vector of darts
301 302
	 *  @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)
303
	 */
304
	void splitSurface(std::vector<Dart>& vd, bool firstSideClosed = true, bool secondSideClosed = true);
Pierre Kraemer's avatar
Pierre Kraemer committed
305 306 307 308 309 310 311
	//@}

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

	//@{
Pierre Kraemer's avatar
Pierre Kraemer committed
312 313 314
	//! Test if vertices v1 and v2 represent the same oriented vertex
	/*! @param v1 a vertex
	 *  @param v2 a vertex
Pierre Kraemer's avatar
Pierre Kraemer committed
315
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
316
	bool sameOrientedVertex(Vertex v1, Vertex v2) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
317

Pierre Kraemer's avatar
Pierre Kraemer committed
318 319 320
	//! Test if vertices v1 and v2 represent the same vertex
	/*! @param v1 a vertex
	 *  @param v2 a vertex
321
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
322
	bool sameVertex(Vertex v1, Vertex v2) const;
323

Pierre Kraemer's avatar
Pierre Kraemer committed
324 325
	//! Compute the number of edges of the vertex v
	/*! @param v a vertex
326
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
327
	unsigned int vertexDegree(Vertex v) const;
328

Pierre Kraemer's avatar
Pierre Kraemer committed
329 330
	//! Check number of edges of the vertex v with given parameter
	/*! @param v a vertex
331
	 *	@param vd degree to compare with
Pierre Kraemer's avatar
Pierre Kraemer committed
332
	 *  @return negative/null/positive if vertex degree is less/equal/greater than given degree
333
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
334
	int checkVertexDegree(Vertex v, unsigned int vd) const;
335

Pierre Kraemer's avatar
Pierre Kraemer committed
336 337
	//! Tell if the vertex v is on the boundary of the map
	/*! @param v a vertex
338
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
339
	bool isBoundaryVertex(Vertex v) const;
340

Pierre Kraemer's avatar
Pierre Kraemer committed
341
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
342
	 * find the dart of vertex v that belongs to the boundary
Pierre Kraemer's avatar
Pierre Kraemer committed
343
	 * return NIL if the vertex is not on the boundary
Pierre Kraemer's avatar
Pierre Kraemer committed
344
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
345
	Dart findBoundaryEdgeOfVertex(Vertex v) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
346

Pierre Kraemer's avatar
Pierre Kraemer committed
347 348 349
	//! Test if edges e1 and e2 represent the same edge
	/*! @param e1 an edge
	 *  @param e2 an edge
350
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
351
	bool sameEdge(Edge e1, Edge e2) const;
352

Pierre Kraemer's avatar
Pierre Kraemer committed
353
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
354
	 * tell if the edge e is on the boundary of the map
Pierre Kraemer's avatar
Pierre Kraemer committed
355
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
356
	bool isBoundaryEdge(Edge e) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
357

Pierre Kraemer's avatar
Pierre Kraemer committed
358 359 360
	//! Test if faces f1 and f2 represent the same oriented face
	/*! @param f1 a face
	 *  @param f2 a face
untereiner's avatar
untereiner committed
361
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
362
	bool sameOrientedFace(Face f1, Face f2) const;
untereiner's avatar
untereiner committed
363

Pierre Kraemer's avatar
Pierre Kraemer committed
364 365 366
	//! Test if faces f1 and f2 represent the same face
	/*! @param f1 a face
	 *  @param f2 a face
Pierre Kraemer's avatar
Pierre Kraemer committed
367
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
368
	bool sameFace(Face f1, Face f2) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
369

370
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
371
	 * compute the number of edges of the face f
372
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
373
	unsigned int faceDegree(Face f) const;
Sylvain Thery's avatar
Sylvain Thery committed
374

Pierre Kraemer's avatar
Pierre Kraemer committed
375 376 377 378
	//! Check number of edges of the face f with given parameter
	/*! @param f a face
	 *	@param fd degree to compare with
	 *  @return negative/null/positive if face degree is less/equal/greater than given degree
379
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
380
	int checkFaceDegree(Face f, unsigned int fd) const;
381

Pierre Kraemer's avatar
Pierre Kraemer committed
382
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
383
	 * tell if the face f is incident to the boundary of the map
Pierre Kraemer's avatar
Pierre Kraemer committed
384
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
385
	bool isFaceIncidentToBoundary(Face f) const;
386

387
	/**
Pierre Kraemer's avatar
Pierre Kraemer committed
388 389
	 * find the dart of face f that belongs to the boundary
	 * return NIL if the face is not incident to the boundary
390
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
391
	Dart findBoundaryEdgeOfFace(Face f) const;
392

Pierre Kraemer's avatar
Pierre Kraemer committed
393
	//! Test if volumes v1 and v2 represent the same oriented volume
Pierre Kraemer's avatar
Pierre Kraemer committed
394 395 396
	/*! @param d a dart
	 *  @param e a dart
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
397
	bool sameOrientedVolume(Vol v1, Vol v2) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
398

Pierre Kraemer's avatar
Pierre Kraemer committed
399
	//! Test if volumes v1 and v2 represent the same volume
400
	/*! @param d a dart
401
	 *  @param e a dart
Pierre Kraemer's avatar
Pierre Kraemer committed
402
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
403
	bool sameVolume(Vol v1, Vol v2) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
404

Pierre Kraemer's avatar
Pierre Kraemer committed
405
	//! Compute the number of faces in the volume v
406
	/*! @param d a dart
Pierre Kraemer's avatar
Pierre Kraemer committed
407
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
408
	unsigned int volumeDegree(Vol v) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
409

Pierre Kraemer's avatar
Pierre Kraemer committed
410 411
	//! Check number of faces of the volume v with given parameter
	/*! @param v a volume
412
	 *	@param vd degree to compare with
Pierre Kraemer's avatar
Pierre Kraemer committed
413
	 *  @return negative/null/positive if volume degree is less/equal/greater than given degree
414
	 */
Pierre Kraemer's avatar
Pierre Kraemer committed
415
	int checkVolumeDegree(Vol v, unsigned int vd) const;
416

Pierre Kraemer's avatar
Pierre Kraemer committed
417 418 419 420 421
	// 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
422
	bool isTriangular() const;
Pierre Kraemer's avatar
Pierre Kraemer committed
423

Pierre Kraemer's avatar
Pierre Kraemer committed
424
	// TODO a mettre en algo
Pierre Kraemer's avatar
Pierre Kraemer committed
425 426
	/**
	 * Check if map is complete
Pierre Kraemer's avatar
Pierre Kraemer committed
427
	 * Should be executed after import
Pierre Kraemer's avatar
Pierre Kraemer committed
428
	 */
Sylvain Thery's avatar
Sylvain Thery committed
429
	virtual bool check() const;
untereiner's avatar
untereiner committed
430 431

	/**
432
	 * Check if a serie of edges is an oriented simple close path
untereiner's avatar
untereiner committed
433 434
	 */
	virtual bool checkSimpleOrientedPath(std::vector<Dart>& vd);
Pierre Kraemer's avatar
Pierre Kraemer committed
435 436 437 438 439 440
	//@}

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

441
	//@{
Pierre Kraemer's avatar
Pierre Kraemer committed
442 443 444 445
	//! Apply a functor on every dart of a vertex
	/*! @param d a dart of the vertex
	 *  @param f the functor to apply
	 */
446
	void foreach_dart_of_vertex(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
447

untereiner's avatar
untereiner committed
448
	//! Apply a functor on every dart of an edge
Pierre Kraemer's avatar
Pierre Kraemer committed
449 450 451
	/*! @param d a dart of the edge
	 *  @param f the functor to apply
	 */
452
	void foreach_dart_of_edge(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
453

454
	//! Apply a functor on every dart of an face
455 456 457
	/*! @param d a dart of the volume
	 *  @param f the functor to apply
	 */
458
	void foreach_dart_of_face(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
459

Pierre Kraemer's avatar
Pierre Kraemer committed
460 461 462 463
	//! Apply a functor on every dart of an face
	/*! @param d a dart of the volume
	 *  @param f the functor to apply
	 */
464
	void foreach_dart_of_volume(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
Pierre Kraemer's avatar
Pierre Kraemer committed
465

Pierre Kraemer's avatar
Pierre Kraemer committed
466 467 468 469
	//! Apply a functor on every dart of a connected component
	/*! @param d a dart of the connected component
	 *  @param f the functor to apply
	 */
470
	void foreach_dart_of_cc(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
471 472 473 474 475

	//! 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
	 */
476
	void foreach_dart_of_vertex1(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
477 478 479 480 481

	//! 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
	 */
482
	void foreach_dart_of_edge1(Dart d, std::function<void (Dart)>& f, unsigned int thread = 0) const;
483

Pierre Kraemer's avatar
Pierre Kraemer committed
484
	//@}
Sylvain Thery's avatar
Sylvain Thery committed
485

Pierre Kraemer's avatar
Pierre Kraemer committed
486 487 488 489
	/*! @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
490
	//@{
491 492 493 494 495
	/**
	 * create a face of map1 marked as boundary
	 */
	Dart newBoundaryCycle(unsigned int nbE);

496
	//! 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
497 498 499
	/*! \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)
500
	 *  @param forboundary tag the created face as boundary (default is true)
Sylvain Thery's avatar
Sylvain Thery committed
501 502
	 *  @return the degree of the created face
	 */
503
	virtual unsigned int closeHole(Dart d, bool forboundary = true);
Sylvain Thery's avatar
Sylvain Thery committed
504

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

	/*! @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
528 529 530 531 532 533 534
};

} // namespace CGoGN

#include "Topology/map/map2.hpp"

#endif