gmap2.cpp 13.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-2011, 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.u-strasbg.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 48 49 50 51 52 53 54 55 56 57 58
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#include "Topology/gmap/gmap2.h"

namespace CGoGN
{

/*! @name Constructors and Destructors
 *  To generate or delete cells in a 2-G-map
 *************************************************************************/

void GMap2::deleteFace(Dart d)
{
	Dart e = d ;
	do
	{
		phi2unsew(e) ;	// unsew the face of d
		e = phi1(e) ;	// from all its adjacent faces
	} while (e != d) ;
	GMap1::deleteFace(d);	// delete the face
}

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

void GMap2::splitVertex(Dart d, Dart e)
{
	assert(sameOrientedVertex(d, e));
	Dart dd = phi2(d) ;
	Dart ee = phi2(e) ;
	GMap1::cutEdge(dd);			// Cut the edge of dd (make a new edge)
	GMap1::cutEdge(ee);			// Cut the edge of ee (make a new edge)
	phi2sew(phi1(dd),phi1(ee));	// Sew the two faces along the new edge
}

59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
bool GMap2::deleteVertex(Dart d)
{
	if(isBoundaryVertex(d))
		return false ;

	Dart vit = d ;
	do
	{
		Dart f = phi_1(phi2(vit)) ;
		phi1sew(vit, f) ;
		vit = alpha1(vit) ;
	} while(vit != d) ;
	GMap1::deleteFace(d) ;

	return true ;
}

Pierre Kraemer's avatar
Pierre Kraemer committed
76 77 78 79 80 81 82 83 84 85 86 87 88
void GMap2::cutEdge(Dart d)
{
	GMap1::cutEdge(d);		// Cut the edge of d
	Dart nd = phi1(d);
	Dart e = beta2(d);
	if (e != d)				// Test if an opposite edge exists
	{
		GMap1::cutEdge(e);	// Cut the opposite edge
		Dart ne = phi1(e);
		phi2sew(nd, beta0(ne));	// sew the two new edges
	}
}

89
Dart GMap2::collapseEdge(Dart d, bool delDegenerateFaces = true)
Pierre Kraemer's avatar
Pierre Kraemer committed
90
{
91 92 93 94
	Dart resV ;

	Dart e = phi2(d);
	if (e != d)			// Test if an opposite edge exists
Pierre Kraemer's avatar
Pierre Kraemer committed
95
	{
96 97 98 99
		phi2unsew(d);	// Unlink the opposite edges
		Dart f = phi1(e) ;
		Dart g = phi_1(e) ;

100
		if(f != d && !isFaceTriangle(e))
101 102 103
			resV = f ;
		else if(phi2(g) != g)
			resV = phi2(g) ;
104
		else if(f != d && phi2(f) != f)
105 106
			resV = phi1(phi2(f)) ;

Pierre Kraemer's avatar
Pierre Kraemer committed
107 108 109 110 111 112 113 114
		if (f != e && delDegenerateFaces)
		{
			GMap1::collapseEdge(e);		// Collapse edge e
			collapseDegeneratedFace(f);	// and collapse its face if degenerated
		}
		else
			GMap1::collapseEdge(e);	// Just collapse edge e
	}
115 116 117 118 119 120 121 122 123 124 125 126 127 128

	Dart f = phi1(d) ;
	Dart g = phi_1(d) ;

	if(resV == Dart::nil())
	{
		if(!isFaceTriangle(d))
			resV = f ;
		else if(phi2(g) != g)
			resV = phi2(g) ;
		else if(phi2(f) != f)
			resV = phi1(phi2(f)) ;
	}

Pierre Kraemer's avatar
Pierre Kraemer committed
129 130 131 132 133 134 135
	if (f != d && delDegenerateFaces)
	{
		GMap1::collapseEdge(d);		// Collapse edge d
		collapseDegeneratedFace(f);	// and collapse its face if degenerated
	}
	else
		GMap1::collapseEdge(d);	// Just collapse edge d
136 137

	return resV ;
Pierre Kraemer's avatar
Pierre Kraemer committed
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
}

bool GMap2::flipEdge(Dart d)
{
	Dart e = phi2(d);			// Test if an opposite
	if (e != d)					// edge exists
	{
		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 GMap2::flipBackEdge(Dart d)
{
	Dart e = phi2(d);			// Test if an opposite
	if (e != d)					// edge exists
	{
		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(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
}

void GMap2::sewFaces(Dart d, Dart e)
{
	phi2sew(d, e);
}

void GMap2::unsewFaces(Dart d)
{
	phi2unsew(d);
}

bool GMap2::collapseDegeneratedFace(Dart d)
{
	Dart e = phi1(d);				// Check if the face is a loop
	if (phi1(e) == d)				// Yes: it contains one or two edge(s)
	{
		Dart d2 = beta2(d);			// Check opposite edges
		Dart e2 = beta2(e);
		if (d2 != d) phi2unsew(d);	// Update phi2-links if needed
		if (e2 != e) phi2unsew(e);
		if (d2 != d && e2 != e)
			phi2sew(d2, e2);
		GMap1::deleteFace(d);		// Delete the single edge or two edges of the loop
		return true ;
	}
	return false ;
}

void GMap2::splitFace(Dart d, Dart e)
{
	GMap1::splitFace(d, e);			// Split the face
	phi2sew(beta1(d), beta1(e));	// Sew the two resulting faces along the new edge
}

bool GMap2::mergeFaces(Dart d)
{
	Dart e = phi2(d) ;
	if(e != d)
	{
		phi2unsew(d);			// unsew the face of d
		GMap1::mergeFaces(d, e); // merge the two faces along edges of d and e
		return true ;
	}
	return false ;
}

void GMap2::extractTrianglePair(Dart d)
{
	assert(isFaceTriangle(d)) ;
	Dart e = phi2(d) ;
	if(e != d)
	{
		assert(isFaceTriangle(e)) ;
		Dart e1 = phi2(phi1(e)) ;
		Dart e2 = phi2(phi_1(e)) ;
		phi2unsew(e1) ;
		phi2unsew(e2) ;
		phi2sew(e1, e2) ;
	}
	Dart d1 = phi2(phi1(d)) ;
	Dart d2 = phi2(phi_1(d)) ;
	phi2unsew(d1) ;
	phi2unsew(d2) ;
	phi2sew(d1, d2) ;
}

void GMap2::insertTrianglePair(Dart d, Dart v1, Dart v2)
{
	assert(v1 != v2 && sameOrientedVertex(v1, v2)) ;
	assert(isFaceTriangle(d) && phi2(phi1(d)) == phi1(d) && phi2(phi_1(d)) == phi_1(d)) ;
	Dart e = phi2(d) ;
	if(e != d)
	{
		assert(isFaceTriangle(e) && phi2(phi1(e)) == phi1(e) && phi2(phi_1(e)) == phi_1(e)) ;
		Dart vv2 = phi2(v2) ;
		phi2unsew(v2) ;
		phi2sew(phi_1(e), v2) ;
		phi2sew(phi1(e), vv2) ;
	}
	Dart vv1 = phi2(v1) ;
	phi2unsew(v1) ;
	phi2sew(phi_1(d), v1) ;
	phi2sew(phi1(d), vv1) ;
}

//	TODO check this function
bool GMap2::mergeVolumes(Dart d, Dart e)
{
	// First traversal of both faces to check the face sizes
	// and stored their edges to efficiently access them further
	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)
	{
		Dart d2 = phi2(*dIt);			// Search the faces adjacent to dNext and eNext
		Dart e2 = phi2(*eIt);
		if (d2 != *dIt) phi2unsew(d2);	// Unlink the two adjacent faces from dNext and eNext
		if (e2 != *eIt) phi2unsew(e2);
		if (d2 != *dIt && e2 != *eIt) phi2sew(d2,e2); // Link the two adjacent faces together if they exists
	}
	GMap1::deleteFace(d);	// Delete the two alone faces
	GMap1::deleteFace(e);

	return true ;
}

//	TODO check this function
unsigned int GMap2::closeHole(Dart d)
{
	assert(phi2(d) == d);	// Nothing to close

	Dart first = GMap1::newEdge();	// 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);

	if (countEdges == 2)
	{
		countEdges = 0 ;
		collapseDegeneratedFace(first); // if the closing face is 2-sided, collapse it
	}

	return countEdges ;
}

void GMap2::closeMap(DartMarker& marker)
{
	// Search the map for topological holes (fixed point for phi2)
	for (Dart d = begin(); d != end(); next(d))
	{
		if (phi2(d) == d)
		{
			closeHole(d);
			marker.markOrbit(FACE_ORBIT, phi2(d)) ;
		}
	}
}

//DartMarker GMap2::markCCOrientation(Dart d)
//{
//	// lock a marker
//	DartMarker markCC(*this);
//
//	// init algo with parameter dart
//	std::list<Dart> darts_list;
//	darts_list.push_back(d);
//	markCC.mark(d);
//
//	// use iterator for begin of not yet treated darts
//	std::list<Dart>::iterator beg = darts_list.begin();
//
//	// until all darts treated
//	while (beg != darts_list.end())
//	{
//		Dart d1 = *beg;
//		// add phi<1> and phi<2> successor if they are not yet marked
//		Dart d2 = beta2(beta0(d1));
//		Dart d3 = beta1(beta0(d1));
//
//		if (!markCC.isMarked(d2))
//		{
//			darts_list.push_back(d2);
//			markCC.mark(d2);
////			markCC.mark(beta0(d2));
//		}
//		if (!markCC.isMarked(d3))
//		{
//			darts_list.push_back(d3);
//			markCC.mark(d3);
////			markCC.mark(beta0(d3));
//		}
//		// step to next dart of list
//		beg++;
//	}
//	return markCC;
//}

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

bool GMap2::sameOrientedVertex(Dart d, Dart e)
{
	Dart dNext = d;				// Foreach dart dNext in the vertex of d
	do
	{
		if (dNext == e)			// Test equality with e
			return true;
		dNext = alpha1(dNext);
	} while (dNext != d);
	return false;				// None is equal to e => vertices are distinct
}

bool GMap2::sameVertex(Dart d, Dart e)
{
	Dart dNext = d;				// Foreach dart dNext in the vertex of d
	do
	{
		if (dNext == e || beta2(dNext) == e)	// Test equality with e
			return true;
		dNext = alpha1(dNext);
	} while (dNext != d);
	return false;				// None is equal to e => vertices are distinct
}

unsigned int GMap2::vertexDegree(Dart d)
{
	unsigned int count = 0 ;
	Dart dNext = d ;
	do
	{
		++count ;
		dNext = alpha1(dNext) ;
	} while (dNext != d) ;
	return count ;
}

bool GMap2::isBoundaryVertex(Dart d)
{
	Dart dNext = d ;
	do
	{
		if(beta2(dNext) == dNext)
			return true ;
441
		dNext = alpha1(dNext) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
442 443 444 445 446 447
	} while (dNext != d) ;
	return false ;
}

bool GMap2::check()
{
448
	CGoGNout << "Check: topology begin" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
449 450 451 452 453
	for(Dart d = begin(); d != end(); next(d))
	{
		Dart dd = beta0(d);
		if (beta0(dd) != d)	// beta0 involution ?
		{
454
			CGoGNout << "Check: beta0 is not an involution" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
455 456 457 458 459 460
			return false;
		}

		dd = beta1(d);
		if (beta1(dd) != d)	// beta1 involution ?
		{
461
			CGoGNout << "Check: beta1 is not an involution" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
462 463 464 465 466 467
			return false;
		}

		dd = beta2(d);
		if (beta2(dd) != d)	// beta2 involution ?
		{
468
			CGoGNout << "Check: beta2 is not an involution" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
469 470 471 472
			return false;
		}
	}

473
	CGoGNout << "Check: topology ok" << CGoGNendl;
Pierre Kraemer's avatar
Pierre Kraemer committed
474 475 476 477 478 479 480
	return true;
}

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

Sylvain Thery's avatar
Sylvain Thery committed
481
bool GMap2::foreach_dart_of_oriented_vertex(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
482 483 484 485 486 487 488 489 490 491 492
{
	Dart dNext = d;
	do
	{
		if (f(dNext))
			return true;
		dNext = alpha1(dNext);
 	} while (dNext != d);
 	return false;
}

Sylvain Thery's avatar
Sylvain Thery committed
493
bool GMap2::foreach_dart_of_vertex(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
494
{
Sylvain Thery's avatar
Sylvain Thery committed
495
	return foreach_dart_of_oriented_vertex(d, f, thread) || foreach_dart_of_oriented_vertex(beta1(d), f, thread) ;
Pierre Kraemer's avatar
Pierre Kraemer committed
496 497
}

Sylvain Thery's avatar
Sylvain Thery committed
498
bool GMap2::foreach_dart_of_edge(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517
{
	if (f(d))
		return true ;
	Dart e = beta0(d) ;
	if (f(e))
		return true ;

	Dart d2 = beta2(d) ;
	if (d2 != d)
	{
		if (f(d2))
			return true ;
		e = beta0(d2) ;
		if (f(e))
			return true ;
	}
	return false ;
}

Sylvain Thery's avatar
Sylvain Thery committed
518
bool GMap2::foreach_dart_of_cc(Dart d, FunctorType& f, unsigned int thread)
Pierre Kraemer's avatar
Pierre Kraemer committed
519 520 521
{
	bool found = false;
	// lock a marker
Sylvain Thery's avatar
Sylvain Thery committed
522
	DartMarkerStore markCC(*this,thread);
Pierre Kraemer's avatar
Pierre Kraemer committed
523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568

	// init algo with parameter dart
	std::list<Dart> darts_list;
	darts_list.push_back(d);
	markCC.mark(d);

	// use iterator for begin of not yet treated darts
	std::list<Dart>::iterator dit = darts_list.begin();

	// until all darts treated
	while (dit != darts_list.end())
	{
		Dart d1 = *dit;
		// add phi<1> and phi<2> successor if they are not yet marked
		Dart d2 = beta0(d1);
		Dart d3 = beta1(d1);
		Dart d4 = beta2(d1);
		if (!markCC.isMarked(d2))
		{
			darts_list.push_back(d2);
			markCC.mark(d2);
		}
		if (!markCC.isMarked(d3))
		{
			darts_list.push_back(d3);
			markCC.mark(d3);
		}
		if (!markCC.isMarked(d4))
		{
			darts_list.push_back(d4);
			markCC.mark(d4);
		}
		// step to next dart of list
		dit++;

		// apply functor
		if (f(d1))
		{	// set dit to stop traversal
			dit = darts_list.end();
			found = true;
		}
	}
	return found;
}

} // namespace CGoGN