map2.cpp 19.9 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
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#include "Topology/map/map2.h"
26
#include "Topology/generic/traversorCell.h"
27
#include "Topology/generic/dartmarker.h"
Pierre Kraemer's avatar
Pierre Kraemer committed
28 29 30 31

namespace CGoGN
{

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
void Map2::rdfi(Dart t, DartMarker& m1, DartMarker& m2)
{
	Dart p = NIL;
	while (!(p == NIL && (t == NIL || (m1.isMarked(t) || m2.isMarked(t)) ) ) )
	{
		if (t == NIL || (m1.isMarked(t) || m2.isMarked(t)))
		{
			if (m2.isMarked(p))			// pop
			{
				Dart q = phi2(p);		//	q = p->s1;
				unsigned int pi=dartIndex(p);
				(*m_phi2)[pi]=t;		//	p->s1 = t;
				t = p;
				p = q;
	     	}
			else						// swing
	     	{
				m2.mark(p);				//	p->val = 2;
				Dart q = phi1(p);		//	q = p->s0;
				unsigned int pi=dartIndex(p);
				(*m_phi1)[pi]=t;		//	p->s0 = t;
				t = phi2(p);			//	t = p->s1;
				(*m_phi2)[pi]=q;		//	p->s1 = q;
			}
		}
		else							 // push
		{
			m1.mark(t);					//	t->val = 1;
			Dart q = phi1(t);			//	q = t->s0;
			unsigned int ti=dartIndex(t);
			(*m_phi1)[ti]=p;			//	t->s0 = p;
			p = t;
			t = q;
		}
	}
}

Pierre Kraemer's avatar
Pierre Kraemer committed
69 70 71 72
void Map2::compactTopoRelations(const std::vector<unsigned int>& oldnew)
{
	for (unsigned int i = m_attribs[DART].begin(); i != m_attribs[DART].end(); m_attribs[DART].next(i))
	{
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
		unsigned int d_index = dartIndex(m_phi1->operator[](i));
		if (d_index != oldnew[d_index])
			m_phi1->operator[](i) = Dart(oldnew[d_index]);

		d_index = dartIndex(m_phi_1->operator[](i));
		if (d_index != oldnew[d_index])
			m_phi_1->operator[](i) = Dart(oldnew[d_index]);

		d_index = dartIndex(m_phi2->operator[](i));
		if (d_index != oldnew[d_index])
			m_phi2->operator[](i) = Dart(oldnew[d_index]);

//		{
//			Dart& d = m_phi1->operator [](i);
//			Dart e = Dart(oldnew[d.index]);
//			if (d != e)
//				d = e;
//		}
//		{
//			Dart& d = m_phi_1->operator [](i);
//			Dart e = Dart(oldnew[d.index]);
//			if (d != e)
//				d = e;
//		}
//		{
//			Dart& d = m_phi2->operator [](i);
//			Dart e = Dart(oldnew[d.index]);
//			if (d != e)
//				d = e;
//		}
Pierre Kraemer's avatar
Pierre Kraemer committed
103 104 105
	}
}

Pierre Kraemer's avatar
Pierre Kraemer committed
106 107 108 109
/*! @name Generator and Deletor
 *  To generate or delete faces in a 2-map
 *************************************************************************/

110
Dart Map2::newFace(unsigned int nbEdges, bool withBoundary)
Pierre Kraemer's avatar
Pierre Kraemer committed
111
{
112
	Dart d = Map1::newCycle(nbEdges);
113
	if (withBoundary)
114
	{
115 116
		Dart e = Map1::newBoundaryCycle(nbEdges);

117
		Dart it = d;
118 119
		do
		{
120 121
			phi2sew(it, e);
			it = phi1(it);
122
			e = phi_1(e);
123
		} while (it != d);
124 125
	}
	return d;
126 127
}

128
void Map2::deleteFace(Dart d, bool withBoundary)
129 130
{
	assert(!isBoundaryMarked(d)) ;
131 132 133 134 135 136 137 138 139 140 141 142 143 144 145
	if (withBoundary)
	{
		Dart it = d ;
		do
		{
			if(!isBoundaryEdge(it))
				unsewFaces(it) ;
			it = phi1(it) ;
		} while(it != d) ;
		Dart dd = phi2(d) ;
		Map1::deleteCycle(d) ;
		Map1::deleteCycle(dd) ;
		return;
	}
	//else with remove the face and create fixed points
146
	Dart it = d ;
Pierre Kraemer's avatar
Pierre Kraemer committed
147 148
	do
	{
149
		phi2unsew(it);
150 151
		it = phi1(it) ;
	} while(it != d) ;
152
	Map1::deleteCycle(d);
153 154
}

untereiner's avatar
untereiner committed
155 156 157 158 159
void Map2::deleteCC(Dart d)
{
	DartMarkerStore mark(*this);

	std::vector<Dart> visited;
160
	visited.reserve(1024) ;
untereiner's avatar
untereiner committed
161
	visited.push_back(d);
162
	mark.mark(d) ;
untereiner's avatar
untereiner committed
163

164
	for(unsigned int i = 0; i < visited.size(); ++i)
untereiner's avatar
untereiner committed
165
	{
166
		Dart d1 = phi1(visited[i]) ;
167
		if(!mark.isMarked(d1))
untereiner's avatar
untereiner committed
168
		{
169 170 171
			visited.push_back(d1) ;
			mark.mark(d1);
		}
172
		Dart d2 = phi2(visited[i]) ;
173 174 175 176
		if(!mark.isMarked(d2))
		{
			visited.push_back(d2) ;
			mark.mark(d2);
untereiner's avatar
untereiner committed
177 178 179
		}
	}

180
	for(std::vector<Dart>::iterator it = visited.begin(); it != visited.end(); ++it)
untereiner's avatar
untereiner committed
181 182 183
		deleteDart(*it) ;
}

184 185
void Map2::fillHole(Dart d)
{
186 187 188 189 190
	assert(isBoundaryEdge(d)) ;
	Dart dd = d ;
	if(!isBoundaryMarked(dd))
		dd = phi2(dd) ;
	boundaryUnmarkOrbit(FACE, dd) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
191 192 193 194 195 196 197 198
}

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

void Map2::splitVertex(Dart d, Dart e)
{
David Cazier's avatar
David Cazier committed
199 200 201 202 203 204
	assert(sameOrientedVertex(d, e)) ;
	Dart d2 = phi2(d) ; assert(d != d2) ;
	Dart e2 = phi2(e) ; assert(e != e2) ;
	Dart nd = Map1::cutEdge(d2) ;	// Cut the edge of dd (make a new half edge)
	Dart ne = Map1::cutEdge(e2) ;	// Cut the edge of ee (make a new half edge)
	phi2sew(nd, ne) ;				// Sew the two faces along the new edge
Pierre Kraemer's avatar
Pierre Kraemer committed
205 206
}

207
Dart Map2::deleteVertex(Dart d)
Pierre Kraemer's avatar
Pierre Kraemer committed
208 209
{
	if(isBoundaryVertex(d))
210
		return NIL ;
Pierre Kraemer's avatar
Pierre Kraemer committed
211

212
	Dart res = NIL ;
Pierre Kraemer's avatar
Pierre Kraemer committed
213 214 215
	Dart vit = d ;
	do
	{
216 217 218
		if(res == NIL && phi1(phi1(d)) != d)
			res = phi1(d) ;

Pierre Kraemer's avatar
Pierre Kraemer committed
219 220
		Dart f = phi_1(phi2(vit)) ;
		phi1sew(vit, f) ;
221

Pierre Kraemer's avatar
Pierre Kraemer committed
222 223
		vit = alpha1(vit) ;
	} while(vit != d) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
224
	Map1::deleteCycle(d) ;
225
	return res ;
Pierre Kraemer's avatar
Pierre Kraemer committed
226 227
}

David Cazier's avatar
David Cazier committed
228
Dart Map2::cutEdge(Dart d)
Pierre Kraemer's avatar
Pierre Kraemer committed
229 230
{
	Dart e = phi2(d);
231
	phi2unsew(d);					// remove old phi2 links
Pierre Kraemer's avatar
Pierre Kraemer committed
232 233
	Dart nd = Map1::cutEdge(d);		// Cut the 1-edge of d
	Dart ne = Map1::cutEdge(e);		// Cut the 1-edge of phi2(d)
234
	phi2sew(d, ne);					// Correct the phi2 links
Pierre Kraemer's avatar
Pierre Kraemer committed
235
	phi2sew(e, nd);
David Cazier's avatar
David Cazier committed
236
	return nd;
Pierre Kraemer's avatar
Pierre Kraemer committed
237 238
}

Pierre Kraemer's avatar
Pierre Kraemer committed
239
bool Map2::uncutEdge(Dart d)
Pierre Kraemer's avatar
Pierre Kraemer committed
240
{
Pierre Kraemer's avatar
Pierre Kraemer committed
241
	if(vertexDegree(phi1(d)) == 2)
Pierre Kraemer's avatar
Pierre Kraemer committed
242
	{
243
		Dart e = phi2(phi1(d)) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
244 245
		phi2unsew(e) ;
		phi2unsew(d) ;
246 247
		Map1::uncutEdge(d) ;
		Map1::uncutEdge(e) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
248
		phi2sew(d, e) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
249
		return true ;
Pierre Kraemer's avatar
Pierre Kraemer committed
250
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
251
	return false ;
Pierre Kraemer's avatar
Pierre Kraemer committed
252 253
}

254
Dart Map2::collapseEdge(Dart d, bool delDegenerateFaces)
Pierre Kraemer's avatar
Pierre Kraemer committed
255
{
Pierre Kraemer's avatar
Pierre Kraemer committed
256
	Dart resV = NIL ;
257 258

	Dart e = phi2(d);
Sylvain Thery's avatar
Sylvain Thery committed
259
	phi2unsew(d);	// Unlink the opposite edges
260

261 262
	Dart f = phi1(e) ;
	Dart h = alpha1(e);
263

264
	if (h != e)
265
		resV = h;
266

267
	if (f != e && delDegenerateFaces)
Sylvain Thery's avatar
Sylvain Thery committed
268 269
	{
		Map1::collapseEdge(e) ;		// Collapse edge e
270
		collapseDegeneratedFace(f) ;// and collapse its face if degenerated
Sylvain Thery's avatar
Sylvain Thery committed
271 272
	}
	else
273
		Map1::collapseEdge(e) ;	// Just collapse edge e
274

275 276
	f = phi1(d) ;
	if(resV == NIL)
277
	{
278 279
		h = alpha1(d);
		if (h != d)
280
			resV = h;
281 282
	}

Pierre Kraemer's avatar
Pierre Kraemer committed
283 284
	if (f != d && delDegenerateFaces)
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
285 286
		Map1::collapseEdge(d) ;		// Collapse edge d
		collapseDegeneratedFace(f) ;// and collapse its face if degenerated
Pierre Kraemer's avatar
Pierre Kraemer committed
287 288
	}
	else
Pierre Kraemer's avatar
Pierre Kraemer committed
289
		Map1::collapseEdge(d) ;	// Just collapse edge d
290 291

	return resV ;
Pierre Kraemer's avatar
Pierre Kraemer committed
292 293 294 295
}

bool Map2::flipEdge(Dart d)
{
Sylvain Thery's avatar
Sylvain Thery committed
296
	if (!isBoundaryEdge(d))
Pierre Kraemer's avatar
Pierre Kraemer committed
297
	{
Sylvain Thery's avatar
Sylvain Thery committed
298
		Dart e = phi2(d);
Pierre Kraemer's avatar
Pierre Kraemer committed
299 300 301 302 303 304 305 306 307 308 309 310 311 312 313
		Dart dNext = phi1(d);
		Dart eNext = phi1(e);
		Dart dPrev = phi_1(d);
		Dart ePrev = phi_1(e);
		phi1sew(d, ePrev);		// Detach the two
		phi1sew(e, dPrev);		// vertices of the edge
		phi1sew(d, dNext);		// Insert the edge in its
		phi1sew(e, eNext);		// new vertices after flip
		return true ;
	}
	return false ; // cannot flip a border edge
}

bool Map2::flipBackEdge(Dart d)
{
Sylvain Thery's avatar
Sylvain Thery committed
314
	if (!isBoundaryEdge(d))
Pierre Kraemer's avatar
Pierre Kraemer committed
315
	{
Sylvain Thery's avatar
Sylvain Thery committed
316
		Dart e = phi2(d);
Pierre Kraemer's avatar
Pierre Kraemer committed
317 318 319 320 321 322 323 324 325 326 327
		Dart dPrev = phi_1(d);
		Dart ePrev = phi_1(e);
		phi1sew(d, ePrev);			// Detach the two
		phi1sew(e, dPrev);			// vertices of the edge
		phi1sew(e, phi_1(dPrev));	// Insert the edge in its
		phi1sew(d, phi_1(ePrev));	// new vertices after flip
		return true ;
	}
	return false ; // cannot flip a border edge
}

328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
//void Map2::insertEdgeInVertex(Dart d, Dart e)
//{
//	assert(!sameVertex(d,e) && phi2(e) == phi_1(e));
//	phi1sew(phi_1(d), phi_1(e));
//}
//
//bool Map2::removeEdgeFromVertex(Dart d)
//{
//	if (!isBoundaryEdge(d))
//	{
//		phi1sew(phi_1(d), phi2(d)) ;
//		return true ;
//	}
//	return false ;
//}
343

344
void Map2::sewFaces(Dart d, Dart e, bool withBoundary)
Pierre Kraemer's avatar
Pierre Kraemer committed
345
{
346 347 348
	// if sewing with fixed points
	if (!withBoundary)
	{
349 350 351
		assert(phi2(d) == d && phi2(e) == e) ;
		phi2sew(d, e) ;
		return ;
352
	}
353

354
	assert(isBoundaryEdge(d) && isBoundaryEdge(e)) ;
355

356 357
	Dart dd = phi2(d) ;
	Dart ee = phi2(e) ;
358

359 360
	phi2unsew(d) ;	// unsew faces from boundary
	phi2unsew(e) ;
361

362 363 364 365 366
	if (ee != phi_1(dd))
		phi1sew(ee, phi_1(dd)) ;	// remove the boundary edge
	if (dd != phi_1(ee))
		phi1sew(dd, phi_1(ee)) ;	// and properly close incident boundaries
	Map1::deleteCycle(dd) ;
Sylvain Thery's avatar
Sylvain Thery committed
367

368
	phi2sew(d, e) ; // sew the faces
Pierre Kraemer's avatar
Pierre Kraemer committed
369 370 371 372
}

void Map2::unsewFaces(Dart d)
{
untereiner's avatar
untereiner committed
373
	assert(!Map2::isBoundaryEdge(d)) ;
374

Pierre Kraemer's avatar
Pierre Kraemer committed
375
	Dart dd = phi2(d) ;
Sylvain Thery's avatar
Sylvain Thery committed
376

Pierre Kraemer's avatar
Pierre Kraemer committed
377
	Dart e = newBoundaryCycle(2) ;
378
	Dart ee = phi1(e) ;
Sylvain Thery's avatar
Sylvain Thery committed
379

Pierre Kraemer's avatar
Pierre Kraemer committed
380
	Dart f = findBoundaryEdgeOfVertex(d) ;
381 382
	Dart ff = findBoundaryEdgeOfVertex(dd) ;

untereiner's avatar
untereiner committed
383
	if(f != NIL)
Pierre Kraemer's avatar
Pierre Kraemer committed
384
		phi1sew(e, phi_1(f)) ;
Sylvain Thery's avatar
Sylvain Thery committed
385

386 387
	if(ff != NIL)
		phi1sew(ee, phi_1(ff)) ;
Sylvain Thery's avatar
Sylvain Thery committed
388

Pierre Kraemer's avatar
Pierre Kraemer committed
389
	phi2unsew(d) ;
390

Pierre Kraemer's avatar
Pierre Kraemer committed
391 392
	phi2sew(d, e) ;		// sew faces
	phi2sew(dd, ee) ;	// to the boundary
Pierre Kraemer's avatar
Pierre Kraemer committed
393 394 395 396
}

bool Map2::collapseDegeneratedFace(Dart d)
{
397
	Dart e = phi1(d) ;				// Check if the face is degenerated
Pierre Kraemer's avatar
Pierre Kraemer committed
398 399
	if (phi1(e) == d)				// Yes: it contains one or two edge(s)
	{
400 401 402 403 404 405 406 407 408 409 410 411 412 413
		Dart d2 = phi2(d) ;			// Check opposite edges
		Dart e2 = phi2(e) ;
		phi2unsew(d) ;
		if(d != e)
		{
			phi2unsew(e) ;
			phi2sew(d2, e2) ;
		}
		else
		{
			phi1sew(d2, phi_1(d2)) ;
			Map1::deleteCycle(d2) ;
		}
		Map1::deleteCycle(d) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
414 415 416 417 418 419 420
		return true ;
	}
	return false ;
}

void Map2::splitFace(Dart d, Dart e)
{
untereiner's avatar
untereiner committed
421
	assert(d != e && Map2::sameFace(d, e)) ;
422 423 424 425
	Dart dd = Map1::cutEdge(phi_1(d)) ;
	Dart ee = Map1::cutEdge(phi_1(e)) ;
	Map1::splitCycle(dd, ee) ;
	phi2sew(dd, ee);
Pierre Kraemer's avatar
Pierre Kraemer committed
426 427 428 429
}

bool Map2::mergeFaces(Dart d)
{
Sylvain Thery's avatar
Sylvain Thery committed
430
	if (!isBoundaryEdge(d))
Pierre Kraemer's avatar
Pierre Kraemer committed
431
	{
Sylvain Thery's avatar
Sylvain Thery committed
432
		Dart e = phi2(d) ;
433
		phi2unsew(d) ;
434
		Map1::mergeCycles(d, phi1(e)) ;
435
		Map1::splitCycle(e, phi1(d)) ;
436
		Map1::deleteCycle(d) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
437 438 439 440 441 442 443 444
		return true ;
	}
	return false ;
}

void Map2::extractTrianglePair(Dart d)
{
	Dart e = phi2(d) ;
Sylvain Thery's avatar
Sylvain Thery committed
445

446 447 448
	assert(!isBoundaryFace(d) && !isBoundaryFace(e)) ;
	assert(faceDegree(d) == 3 && faceDegree(e) == 3) ;

Pierre Kraemer's avatar
Pierre Kraemer committed
449 450 451 452 453
	Dart d1 = phi2(phi1(d)) ;
	Dart d2 = phi2(phi_1(d)) ;
	phi2unsew(d1) ;
	phi2unsew(d2) ;
	phi2sew(d1, d2) ;
454 455 456 457 458 459

	Dart e1 = phi2(phi1(e)) ;
	Dart e2 = phi2(phi_1(e)) ;
	phi2unsew(e1) ;
	phi2unsew(e2) ;
	phi2sew(e1, e2) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
460 461 462 463 464
}

void Map2::insertTrianglePair(Dart d, Dart v1, Dart v2)
{
	Dart e = phi2(d) ;
Sylvain Thery's avatar
Sylvain Thery committed
465

466 467
	assert(v1 != v2 && sameOrientedVertex(v1, v2)) ;
	assert(faceDegree(d) == 3 && faceDegree(phi2(d)) == 3) ;
Sylvain Thery's avatar
Sylvain Thery committed
468

Pierre Kraemer's avatar
Pierre Kraemer committed
469 470 471 472
	Dart vv1 = phi2(v1) ;
	phi2unsew(v1) ;
	phi2sew(phi_1(d), v1) ;
	phi2sew(phi1(d), vv1) ;
473 474 475 476 477

	Dart vv2 = phi2(v2) ;
	phi2unsew(v2) ;
	phi2sew(phi_1(e), v2) ;
	phi2sew(phi1(e), vv2) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
478 479 480 481
}

bool Map2::mergeVolumes(Dart d, Dart e)
{
482
	assert(!isBoundaryMarked(d) && !isBoundaryMarked(e)) ;
Sylvain Thery's avatar
Sylvain Thery committed
483

untereiner's avatar
untereiner committed
484
	if (Map2::isBoundaryFace(d) || Map2::isBoundaryFace(e))
Sylvain Thery's avatar
Sylvain Thery committed
485 486
		return false;

Pierre Kraemer's avatar
Pierre Kraemer committed
487
	// First traversal of both faces to check the face sizes
488
	// and store their edges to efficiently access them further
Sylvain Thery's avatar
Sylvain Thery committed
489

Pierre Kraemer's avatar
Pierre Kraemer committed
490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
	std::vector<Dart> dDarts;
	std::vector<Dart> eDarts;
	dDarts.reserve(16);		// usual faces have less than 16 edges
	eDarts.reserve(16);

	Dart dFit = d ;
	Dart eFit = phi1(e) ;	// must take phi1 because of the use
	do						// of reverse iterator for sewing loop
	{
		dDarts.push_back(dFit) ;
		dFit = phi1(dFit) ;
	} while(dFit != d) ;
	do
	{
		eDarts.push_back(eFit) ;
		eFit = phi1(eFit) ;
	} while(eFit != phi1(e)) ;

	if(dDarts.size() != eDarts.size())
		return false ;

	// Make the sewing: take darts in initial order (clockwise) in first face
	// and take darts in reverse order (counter-clockwise) in the second face
	std::vector<Dart>::iterator dIt;
	std::vector<Dart>::reverse_iterator eIt;
	for (dIt = dDarts.begin(), eIt = eDarts.rbegin(); dIt != dDarts.end(); ++dIt, ++eIt)
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
517
		Dart d2 = phi2(*dIt);	// Search the faces adjacent to dNext and eNext
Pierre Kraemer's avatar
Pierre Kraemer committed
518
		Dart e2 = phi2(*eIt);
519
		phi2unsew(d2);		// Unlink the two adjacent faces from dNext and eNext
Sylvain Thery's avatar
Sylvain Thery committed
520
		phi2unsew(e2);
521
		phi2sew(d2, e2);	// Link the two adjacent faces together
Pierre Kraemer's avatar
Pierre Kraemer committed
522
	}
Pierre Kraemer's avatar
Pierre Kraemer committed
523 524
	Map1::deleteCycle(d);		// Delete the two alone faces
	Map1::deleteCycle(e);
Pierre Kraemer's avatar
Pierre Kraemer committed
525 526 527 528

	return true ;
}

529
void Map2::splitSurface(std::vector<Dart>& vd, bool firstSideClosed, bool secondSideClosed)
530
{
531
//	assert(checkSimpleOrientedPath(vd)) ;
532

533 534
	Dart e = vd.front() ;
	Dart e2 = phi2(e) ;
535 536 537

	//unsew the edge path
	for(std::vector<Dart>::iterator it = vd.begin() ; it != vd.end() ; ++it)
538
		unsewFaces(*it) ;
539

540
	if(firstSideClosed)
541
		Map2::fillHole(e) ;
542

543
	if(secondSideClosed)
544
		Map2::fillHole(e2) ;
545 546
}

Pierre Kraemer's avatar
Pierre Kraemer committed
547 548 549 550 551 552
/*! @name Topological Queries
 *  Return or set various topological information
 *************************************************************************/

bool Map2::sameOrientedVertex(Dart d, Dart e)
{
553
	Dart it = d;				// Foreach dart dNext in the vertex of d
Pierre Kraemer's avatar
Pierre Kraemer committed
554 555
	do
	{
556
		if (it == e)			// Test equality with e
Pierre Kraemer's avatar
Pierre Kraemer committed
557
			return true;
558 559
		it = alpha1(it);
	} while (it != d);
Pierre Kraemer's avatar
Pierre Kraemer committed
560 561 562
	return false;				// None is equal to e => vertices are distinct
}

563 564 565
unsigned int Map2::vertexDegree(Dart d)
{
	unsigned int count = 0 ;
566
	Dart it = d ;
567 568 569
	do
	{
		++count ;
570 571
		it = alpha1(it) ;
	} while (it != d) ;
572 573 574
	return count ;
}

575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
bool Map2::isBoundaryVertex(Dart d)
{
	Dart it = d ;
	do
	{
		if (isBoundaryMarked(it))
			return true ;
		it = alpha1(it) ;
	} while (it != d) ;
	return false ;
}

Dart Map2::findBoundaryEdgeOfVertex(Dart d)
{
	Dart it = d ;
	do
	{
		if (isBoundaryMarked(it))
			return it ;
		it = alpha1(it) ;
	} while (it != d) ;
	return NIL ;
}

bool Map2::isBoundaryFace(Dart d)
{
	Dart it = d ;
	do
	{
		if (isBoundaryMarked(phi2(it)))
			return true ;
		it = phi1(it) ;
	} while (it != d) ;
	return false ;
}

611
bool Map2::sameOrientedVolume(Dart d, Dart e)
Pierre Kraemer's avatar
Pierre Kraemer committed
612
{
613 614 615 616 617 618 619
	DartMarkerStore mark(*this);	// Lock a marker

	std::list<Dart> visitedFaces;	// Faces that are traversed
	visitedFaces.push_back(d);		// Start with the face of d
	std::list<Dart>::iterator face;

	// For every face added to the list
Pierre Kraemer's avatar
Pierre Kraemer committed
620
	for (face = visitedFaces.begin(); face != visitedFaces.end(); ++face)
Pierre Kraemer's avatar
Pierre Kraemer committed
621
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
622
		if (!isBoundaryMarked(*face) && !mark.isMarked(*face))		// Face has not been visited yet
623
		{
Pierre Kraemer's avatar
Pierre Kraemer committed
624
			Dart it = *face ;
625 626
			do
			{
Pierre Kraemer's avatar
Pierre Kraemer committed
627
				if(it == e)
628 629
					return true;

Pierre Kraemer's avatar
Pierre Kraemer committed
630 631 632
				mark.mark(it);						// Mark
				Dart adj = phi2(it);				// Get adjacent face
				if (!isBoundaryMarked(adj) && !mark.isMarked(adj))
633
					visitedFaces.push_back(adj);	// Add it
Pierre Kraemer's avatar
Pierre Kraemer committed
634 635
				it = phi1(it);
			} while(it != *face);
636 637 638
		}
	}
	return false;
Pierre Kraemer's avatar
Pierre Kraemer committed
639 640 641 642 643 644 645 646 647 648 649 650 651
}

unsigned int Map2::volumeDegree(Dart d)
{
	unsigned int count = 0;
	DartMarkerStore mark(*this);		// Lock a marker

	std::vector<Dart> visitedFaces;		// Faces that are traversed
	visitedFaces.reserve(16);
	visitedFaces.push_back(d);			// Start with the face of d
	std::vector<Dart>::iterator face;

	// For every face added to the list
652
	for (unsigned int i = 0; i != visitedFaces.size(); ++i)
Pierre Kraemer's avatar
Pierre Kraemer committed
653
	{
Sylvain Thery's avatar
Sylvain Thery committed
654 655
		Dart df = visitedFaces[i];
		if (!isBoundaryMarked(df) && !mark.isMarked(df))		// Face has not been visited yet
Pierre Kraemer's avatar
Pierre Kraemer committed
656 657
		{
			++count;
658
			Dart it = df ;
Pierre Kraemer's avatar
Pierre Kraemer committed
659 660
			do
			{
661 662
				mark.mark(it);					// Mark
				Dart adj = phi2(it);			// Get adjacent face
Sylvain Thery's avatar
Sylvain Thery committed
663
				if ( !isBoundaryMarked(adj) && !mark.isMarked(adj) )
664 665 666
					visitedFaces.push_back(adj);// Add it
				it = phi1(it);
			} while(it != df);
Pierre Kraemer's avatar
Pierre Kraemer committed
667 668 669 670 671 672 673 674
		}
	}

	return count;
}

bool Map2::isTriangular()
{
675 676
	TraversorF<Map2> t(*this) ;
	for(Dart d = t.begin(); d != t.end(); d = t.next())
Pierre Kraemer's avatar
Pierre Kraemer committed
677
	{
678 679
		if(faceDegree(d) != 3)
			return false ;
Pierre Kraemer's avatar
Pierre Kraemer committed
680 681 682 683 684 685
	}
	return true ;
}

bool Map2::check()
{
686
	CGoGNout << "Check: topology begin" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
687
	DartMarker m(*this);
Pierre Kraemer's avatar
Pierre Kraemer committed
688
	for(Dart d = Map2::begin(); d != Map2::end(); Map2::next(d))
Pierre Kraemer's avatar
Pierre Kraemer committed
689 690 691 692
	{
		Dart d2 = phi2(d);
		if (phi2(d2) != d)	// phi2 involution ?
		{
693
			CGoGNout << "Check: phi2 is not an involution" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
694 695
			return false;
		}
Pierre Kraemer's avatar
Pierre Kraemer committed
696 697 698 699 700
		if(d2 == d)
		{
			CGoGNout << "Check: phi2 fixed point" << CGoGNendl;
			return false;
		}
Pierre Kraemer's avatar
Pierre Kraemer committed
701 702 703 704

		Dart d1 = phi1(d);
		if (phi_1(d1) != d)	// phi1 a une image correcte ?
		{
705
			CGoGNout << "Check: inconsistent phi_1 link" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
706 707 708 709 710
			return false;
		}

		if (m.isMarked(d1))	// phi1 a un seul antécédent ?
		{
711
			CGoGNout << "Check: dart with two phi1 predecessors" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
712 713 714 715 716
			return false;
		}
		m.mark(d1);

		if (d1 == d)
717
			CGoGNout << "Check: (warning) face loop (one edge)" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
718
		if (phi1(d1) == d)
719
			CGoGNout << "Check: (warning) face with only two edges" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
720
		if (phi2(d1) == d)
721
			CGoGNout << "Check: (warning) dangling edge" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
722
	}
723

Pierre Kraemer's avatar
Pierre Kraemer committed
724
	for(Dart d = Map2::begin(); d != Map2::end(); Map2::next(d))
Pierre Kraemer's avatar
Pierre Kraemer committed
725 726 727
	{
		if (!m.isMarked(d))	// phi1 a au moins un antécédent ?
		{
728
			CGoGNout << "Check: dart with no phi1 predecessor" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
729 730 731
			return false;
		}
	}
732

733
	CGoGNout << "Check: topology ok" << CGoGNendl;
734

Pierre Kraemer's avatar
Pierre Kraemer committed
735 736 737
	return true;
}

untereiner's avatar
untereiner committed
738 739
bool Map2::checkSimpleOrientedPath(std::vector<Dart>& vd)
{
Pierre Kraemer's avatar
Pierre Kraemer committed
740
	DartMarkerStore dm(*this) ;
untereiner's avatar
untereiner committed
741 742
	for(std::vector<Dart>::iterator it = vd.begin() ; it != vd.end() ; ++it)
	{
Pierre Kraemer's avatar
Pierre Kraemer committed
743 744 745 746
		if(dm.isMarked(*it))
			return false ;
		dm.markOrbit(VERTEX, *it) ;

untereiner's avatar
untereiner committed
747 748 749 750 751
		std::vector<Dart>::iterator prev ;
		if(it == vd.begin())
			prev = vd.end() - 1 ;
		else
			prev = it - 1 ;
Pierre Kraemer's avatar
Pierre Kraemer committed
752

untereiner's avatar
untereiner committed
753 754 755 756 757 758
		if(!sameVertex(*it, phi1(*prev)))
			return false ;
	}
	return true ;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
759 760 761 762
/*! @name Cell Functors
 *  Apply functors to all darts of a cell
 *************************************************************************/

Sylvain Thery's avatar
Sylvain Thery committed
763
bool Map2::foreach_dart_of_vertex(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
764 765 766 767 768 769 770 771 772 773 774
{
	Dart dNext = d;
	do
	{
		if (f(dNext))
			return true;
		dNext = alpha1(dNext);
 	} while (dNext != d);
 	return false;
}

Sylvain Thery's avatar
Sylvain Thery committed
775
bool Map2::foreach_dart_of_edge(Dart d, FunctorType& fonct, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
776 777 778
{
	if (fonct(d))
		return true;
Sylvain Thery's avatar
Sylvain Thery committed
779
	return fonct(phi2(d));
Pierre Kraemer's avatar
Pierre Kraemer committed
780 781
}

782
bool Map2::foreach_dart_of_cc(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
783
{
untereiner's avatar
untereiner committed
784
	DartMarkerStore mark(*this, thread);	// Lock a marker
Pierre Kraemer's avatar
Pierre Kraemer committed
785 786
	bool found = false;				// Last functor return value

untereiner's avatar
untereiner committed
787 788
	std::vector<Dart> visitedFaces;	// Faces that are traversed
	visitedFaces.reserve(1024) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
789 790 791
	visitedFaces.push_back(d);		// Start with the face of d

	// For every face added to the list
792
	for(unsigned int i = 0; !found && i < visitedFaces.size(); ++i)
Pierre Kraemer's avatar
Pierre Kraemer committed
793
	{
794
		if (!mark.isMarked(visitedFaces[i]))	// Face has not been visited yet
Pierre Kraemer's avatar
Pierre Kraemer committed
795 796
		{
			// Apply functor to the darts of the face
797
			found = Map2::foreach_dart_of_face(visitedFaces[i], f);
Pierre Kraemer's avatar
Pierre Kraemer committed
798 799 800 801 802

			// If functor returns false then mark visited darts (current face)
			// and add non visited adjacent faces to the list of face
			if (!found)
			{
803
				Dart e = visitedFaces[i] ;
Pierre Kraemer's avatar
Pierre Kraemer committed
804 805
				do
				{
806 807 808
					mark.mark(e);				// Mark
					Dart adj = phi2(e);			// Get adjacent face
					if (!mark.isMarked(adj))
Pierre Kraemer's avatar
Pierre Kraemer committed
809
						visitedFaces.push_back(adj);	// Add it
untereiner's avatar
untereiner committed
810
					e = phi1(e);
811
				} while(e != visitedFaces[i]);
Pierre Kraemer's avatar
Pierre Kraemer committed
812 813 814 815 816 817
			}
		}
	}
	return found;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
818
/*! @name Close map after import or creation
819
 *  These functions must be used with care, generally only by import/creation algorithms
Pierre Kraemer's avatar
Pierre Kraemer committed
820 821
 *************************************************************************/

822
unsigned int Map2::closeHole(Dart d, bool forboundary)
Pierre Kraemer's avatar
Pierre Kraemer committed
823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849
{
	assert(phi2(d) == d);		// Nothing to close

	Dart first = newDart();		// First edge of the face that will fill the hole
	unsigned int countEdges = 1;

	phi2sew(d, first);	// phi2-link the new edge to the hole

	Dart dNext = d;	// Turn around the hole
	Dart dPhi1;		// to complete the face
	do
	{
		do
		{
			dPhi1 = phi1(dNext);	// Search and put in dNext
			dNext = phi2(dPhi1);	// the next dart of the hole
		} while (dNext != dPhi1 && dPhi1 != d);

		if (dPhi1 != d)
		{
			Dart next = newDart();	// Add a new edge there and link it to the face
			++countEdges;
			phi1sew(first, next);	// the edge is linked to the face
			phi2sew(dNext, next);	// the face is linked to the hole
		}
	} while (dPhi1 != d);

untereiner's avatar
untereiner committed
850 851
	if(forboundary)
		boundaryMarkOrbit(FACE, phi2(d));
852

Pierre Kraemer's avatar
Pierre Kraemer committed
853 854 855
	return countEdges ;
}

856
unsigned int Map2::closeMap()
Pierre Kraemer's avatar
Pierre Kraemer committed
857 858
{
	// Search the map for topological holes (fix points of phi2)
859
	unsigned int nb = 0 ;
Pierre Kraemer's avatar
Pierre Kraemer committed
860 861 862
	for (Dart d = begin(); d != end(); next(d))
	{
		if (phi2(d) == d)
863 864
		{
			++nb ;
Pierre Kraemer's avatar
Pierre Kraemer committed
865
			closeHole(d);
866
		}
Pierre Kraemer's avatar
Pierre Kraemer committed
867
	}
868
	return nb ;
Pierre Kraemer's avatar
Pierre Kraemer committed
869
}
Pierre Kraemer's avatar
Pierre Kraemer committed
870 871

} // namespace CGoGN