ihm3.hpp 14.7 KB
Newer Older
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           *
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/                                         *
21 22 23 24 25 26 27 28 29 30
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

namespace CGoGN
{

namespace Algo
{

untereiner's avatar
untereiner committed
31
namespace IHM
32 33
{

untereiner's avatar
untereiner committed
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
///***************************************************
// *  		       	    ATTRIBUTES MANAGEMENT    	           	 *
// ***************************************************/
//
//template <typename T>
//AttributeHandler_IHM<T> ImplicitHierarchicalMap3::addAttribute(unsigned int orbit, const std::string& nameAttr)
//{
//	bool addNextLevelCell = false ;
//	if(!isOrbitEmbedded(orbit))
//		addNextLevelCell = true ;
//
//	AttributeHandler<T> h = Map3::addAttribute<T>(orbit, nameAttr) ;
//
//	if(addNextLevelCell)
//	{
//		AttributeContainer& cellCont = m_attribs[orbit] ;
//		AttributeMultiVector<unsigned int>* amv = cellCont.addAttribute<unsigned int>("nextLevelCell") ;
//		m_nextLevelCell[orbit] = amv ;
//		for(unsigned int i = cellCont.begin(); i < cellCont.end(); cellCont.next(i))
//			amv->operator[](i) = EMBNULL ;
//	}
//
//	return AttributeHandler_IHM<T>(this, h.getDataVector()) ;
//}
//
//template <typename T>
//AttributeHandler_IHM<T> ImplicitHierarchicalMap3::getAttribute(unsigned int orbit, const std::string& nameAttr)
//{
//	AttributeHandler<T> h = Map2::getAttribute<T>(orbit, nameAttr) ;
//	return AttributeHandler_IHM<T>(this, h.getDataVector()) ;
//}
untereiner's avatar
untereiner committed
65

66
/***************************************************
untereiner's avatar
untereiner committed
67
 *          			 	    MAP TRAVERSAL         		  		         *
68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
 ***************************************************/

inline Dart ImplicitHierarchicalMap3::newDart()
{
	Dart d = Map3::newDart() ;
	m_dartLevel[d] = m_curLevel ;
	if(m_curLevel > m_maxLevel)			// update max level
		m_maxLevel = m_curLevel ;		// if needed
	return d ;
}

inline Dart ImplicitHierarchicalMap3::phi1(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;
	bool finished = false ;

	unsigned int edgeId = m_edgeId[d] ;
	Dart it = d ;
untereiner's avatar
untereiner committed
86

87 88
	do
	{
untereiner's avatar
untereiner committed
89

90 91 92 93 94
		it = Map3::phi1(it) ;
		if(m_dartLevel[it] <= m_curLevel)
			finished = true ;
		else
		{
95
			while(m_edgeId[it] != edgeId)
96
				it = Map3::phi1(phi2bis(it));
untereiner's avatar
untereiner committed
97

98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117
		}
	} while(!finished) ;

	return it ;
}

inline Dart ImplicitHierarchicalMap3::phi_1(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;
	bool finished = false ;

	Dart it = Map3::phi_1(d) ;
	unsigned int edgeId = m_edgeId[it] ;
	do
	{
		if(m_dartLevel[it] <= m_curLevel)
			finished = true ;
		else
		{
			it = Map3::phi_1(it) ;
118
			while(m_edgeId[it] != edgeId)
untereiner's avatar
untereiner committed
119
				it = Map3::phi_1(phi2bis(it));
120 121 122 123 124 125 126 127 128 129 130 131 132
		}
	} while(!finished) ;

	return it ;
}

//TODO A verifier si besoin d'assertion
inline Dart ImplicitHierarchicalMap3::phi2bis(Dart d)
{
	unsigned int faceId = m_faceId[d];
	Dart it = d;

	it = Map3::phi2(it) ;
untereiner's avatar
untereiner committed
133

134 135 136 137
	if(m_faceId[it] == faceId)
		return it;
	else
	{
untereiner's avatar
untereiner committed
138 139
		do
		{
140
			it = Map3::phi2(Map3::phi3(it));
untereiner's avatar
untereiner committed
141 142
		}
		while(m_faceId[it] != faceId);
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

		return it;
	}
}

inline Dart ImplicitHierarchicalMap3::phi2(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;

	return Map3::phi2(Map3::phi_1(phi1(d))) ;
}

inline Dart ImplicitHierarchicalMap3::phi3(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;

	if(Map3::phi3(d) == d)
		return d;

	return Map3::phi3(Map3::phi_1(phi1(d)));
}

inline Dart ImplicitHierarchicalMap3::alpha0(Dart d)
{
	return phi3(d) ;
}

inline Dart ImplicitHierarchicalMap3::alpha1(Dart d)
{
172
	//assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;
173 174 175 176 177 178

	return Map3::alpha1(d) ;
}

inline Dart ImplicitHierarchicalMap3::alpha2(Dart d)
{
untereiner's avatar
untereiner committed
179 180 181 182 183 184 185
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;

	Dart e = phi2(d);
	Dart f = phi3(e);

	if (f != e)
		return f;
186

untereiner's avatar
untereiner committed
187 188 189 190 191 192 193 194 195 196
	f = d;
	e = phi3(f);
	while (e != f)
	{
		f = phi2(e);
		e = phi3(f);
	}
	return f;

	//return Map3::alpha2(d);
197 198 199 200
}

inline Dart ImplicitHierarchicalMap3::alpha_2(Dart d)
{
untereiner's avatar
untereiner committed
201 202 203 204 205 206 207 208 209 210 211 212 213 214 215
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;

	Dart e = phi3(d);

	if (e != d)
		return phi2(e);

	e = d;
	Dart f = phi2(d);
	while (phi3(f) != f)
	{
		e = phi3(f);
		f = phi2(e);
	}
	return e;
216

untereiner's avatar
untereiner committed
217
	//return Map3::alpha_2(d);
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237
}

inline Dart ImplicitHierarchicalMap3::begin()
{
	Dart d = Map3::begin() ;
	while(m_dartLevel[d] > m_curLevel)
		Map3::next(d) ;
	return d ;
}

inline Dart ImplicitHierarchicalMap3::end()
{
	return Map3::end() ;
}

inline void ImplicitHierarchicalMap3::next(Dart& d)
{
	do
	{
		Map3::next(d) ;
238
	} while(d != Map3::end() && m_dartLevel[d] > m_curLevel) ;
239 240
}

241
inline bool ImplicitHierarchicalMap3::foreach_dart_of_vertex(Dart d, FunctorType& f, unsigned int thread)
242
{
untereiner's avatar
untereiner committed
243
	DartMarkerStore mv(*this,thread);			// Lock a marker
244 245
	bool found = false;					// Last functor return value

246 247 248
	std::vector<Dart> darts;			//Darts that are traversed
	darts.reserve(512);
	darts.push_back(d);			//Start with the dart d
249 250
	mv.mark(d);

251
	for(unsigned int i = 0; !found && i < darts.size(); ++i)
252
	{
253
		Dart dc = darts[i];
254 255 256

		//add phi21 and phi23 successor if they are not marked yet
		Dart d2 = phi2(dc);
untereiner's avatar
untereiner committed
257
		if(d2 != dc)
258
		{
untereiner's avatar
untereiner committed
259 260 261 262 263
			Dart d21 = phi1(d2); // turn in volume
			Dart d23 = phi3(d2); // change volume

			if(!mv.isMarked(d21))
			{
264
				darts.push_back(d21);
untereiner's avatar
untereiner committed
265 266 267
				mv.mark(d21);
			}

268
			if((d23 != d2) && !mv.isMarked(d23))
untereiner's avatar
untereiner committed
269
			{
270
				darts.push_back(d23);
untereiner's avatar
untereiner committed
271 272
				mv.mark(d23);
			}
273 274 275 276 277 278 279 280
		}

		found = f(dc);
	}

	return found;
}

281
inline bool ImplicitHierarchicalMap3::foreach_dart_of_edge(Dart d, FunctorType& f, unsigned int thread)
282 283 284 285 286 287 288
{
	Dart dNext = d;
	do {

		if (f(dNext))
			return true;

289 290
		if (f(phi2(dNext)))
			return true;
291 292 293 294 295 296

		dNext = alpha2(dNext);
	} while (dNext != d);
	return false;
}

297
inline bool ImplicitHierarchicalMap3::foreach_dart_of_oriented_face(Dart d, FunctorType& f, unsigned int thread)
298 299 300 301 302 303 304 305 306 307 308
{
	Dart dNext = d ;
	do
	{
		if (f(dNext))
			return true ;
		dNext = phi1(dNext) ;
	} while (dNext != d) ;
	return false ;
}

309
inline bool ImplicitHierarchicalMap3::foreach_dart_of_face(Dart d, FunctorType& f, unsigned int thread)
310 311 312 313 314 315 316 317
{
	if (foreach_dart_of_oriented_face(d,f)) return true;

	Dart d3 = phi3(d);
	if (d3 != d) return foreach_dart_of_oriented_face(d3,f);
	return false;
}

318
inline bool ImplicitHierarchicalMap3::foreach_dart_of_oriented_volume(Dart d, FunctorType& f, unsigned int thread)
319 320 321 322
{
	DartMarkerStore mark(*this);	// Lock a marker
	bool found = false;				// Last functor return value

323 324
	std::vector<Dart> visitedFaces;	// Faces that are traversed
	visitedFaces.reserve(512) ;
325 326 327
	visitedFaces.push_back(d);		// Start with the face of d

	// For every face added to the list
328
	for(unsigned int i = 0; !found && i < visitedFaces.size(); ++i)
329
	{
330
		if (!mark.isMarked(visitedFaces[i]))		// Face has not been visited yet
331 332
		{
			// Apply functor to the darts of the face
333
			found = foreach_dart_of_oriented_face(visitedFaces[i], f);
334 335 336 337 338

			// If functor returns false then mark visited darts (current face)
			// and add non visited adjacent faces to the list of face
			if (!found)
			{
339
				Dart dNext = visitedFaces[i] ;
340 341 342 343 344 345 346
				do
				{
					mark.mark(dNext);					// Mark
					Dart adj = phi2(dNext);				// Get adjacent face
					if (adj != dNext && !mark.isMarked(adj))
						visitedFaces.push_back(adj);	// Add it
					dNext = phi1(dNext);
347
				} while(dNext != visitedFaces[i]);
348 349 350 351 352 353
			}
		}
	}
	return found;
}

354
inline bool ImplicitHierarchicalMap3::foreach_dart_of_volume(Dart d, FunctorType& f, unsigned int thread)
355 356 357 358
{
	return foreach_dart_of_oriented_volume(d, f) ;
}

359
inline bool ImplicitHierarchicalMap3::foreach_dart_of_cc(Dart d, FunctorType& f, unsigned int thread)
360 361 362 363
{
	return foreach_dart_of_oriented_volume(d, f) ;
}

untereiner's avatar
untereiner committed
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
/***************************************************
 *              LEVELS MANAGEMENT                  *
 ***************************************************/

inline unsigned int ImplicitHierarchicalMap3::getCurrentLevel()
{
	return m_curLevel ;
}

inline void ImplicitHierarchicalMap3::setCurrentLevel(unsigned int l)
{
	assert(l >= 0 || !"Trying to set current level to a negative value") ;
	m_curLevel = l ;
}

inline unsigned int ImplicitHierarchicalMap3::getMaxLevel()
{
	return m_maxLevel ;
}

inline unsigned int ImplicitHierarchicalMap3::getDartLevel(Dart d)
{
	return m_dartLevel[d] ;
}

inline void ImplicitHierarchicalMap3::setDartLevel(Dart d, unsigned int l)
{
	m_dartLevel[d] = l ;
}

/***************************************************
 *             EDGE ID MANAGEMENT                  *
 ***************************************************/

inline unsigned int ImplicitHierarchicalMap3::getNewEdgeId()
{
	return m_edgeIdCount++ ;
}


inline unsigned int ImplicitHierarchicalMap3::getEdgeId(Dart d)
{
	return m_edgeId[d] ;
}

inline void ImplicitHierarchicalMap3::setEdgeId(Dart d, unsigned int i, unsigned int orbit)
{
412
	if(orbit == EDGE)
413 414 415 416 417 418 419 420 421 422 423
	{
		Dart e = d;

		do
		{
			m_edgeId[e] = i;
			m_edgeId[Map3::phi2(e)] = i;

			e = Map3::alpha2(e);
		} while(e != d);
	}
424
	else if(orbit == DART)
425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
	{
		m_edgeId[d] = i;
	}
}

/***************************************************
 *             FACE ID MANAGEMENT                  *
 ***************************************************/

inline unsigned int ImplicitHierarchicalMap3::getNewFaceId()
{
	return m_faceIdCount++;
}

inline unsigned int ImplicitHierarchicalMap3::getFaceId(Dart d)
{
	return m_faceId[d] ;
}

444
inline void ImplicitHierarchicalMap3::setFaceId(unsigned int orbit, Dart d)
445 446
{
	//Mise a jour de l'id de face pour les brins autour d'une arete
447
	if(orbit == EDGE)
448 449 450 451 452
	{
		Dart e = d;

		do
		{
453
			m_faceId[Map3::phi1(e)] = m_faceId[e];
454 455 456 457 458

			e = Map3::alpha2(e);
		}while(e != d);

	}
459 460 461 462 463
}

inline void ImplicitHierarchicalMap3::setFaceId(Dart d, unsigned int i, unsigned int orbit)
{

464
	//Mise a jour de l'id de face pour les brins autour de la face
465
	if(orbit == FACE)
466 467 468 469 470 471 472 473 474 475 476 477 478 479
	{
		Dart e = d;

		do
		{
			m_faceId[e] = i;

			Dart e3 = Map3::phi3(e);
			if(e3 != e)
				m_faceId[e3] = i;

			e = Map3::phi1(e);
		} while(e != d);
	}
480
	else if(orbit == DART)
481 482
	{
		m_faceId[d] = i;
483 484 485

		if(Map3::phi3(d) != d)
			m_faceId[Map3::phi3(d)] = i;
486 487 488 489 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 517 518 519 520 521 522 523
	}
}

/***************************************************
 *               CELLS INFORMATION                 *
 ***************************************************/

//TODO
inline unsigned int ImplicitHierarchicalMap3::vertexInsertionLevel(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;
	return m_dartLevel[d] ;
}

inline unsigned int ImplicitHierarchicalMap3::edgeLevel(Dart d)
{
	assert(m_dartLevel[d] <= m_curLevel || !"Access to a dart introduced after current level") ;

	// the level of an edge is the maximum of the
	// insertion levels of its darts

	unsigned int r = 0;

	Dart e = d;
	do
	{
		unsigned int ld = m_dartLevel[e] ;
		unsigned int ldd = m_dartLevel[phi2(e)] ;
		unsigned int temp = ld < ldd ? ldd : ld;

		r =  r < temp ? temp : r ;

		e = alpha2(e);
	} while(e != d);

	return r;
}

untereiner's avatar
untereiner committed
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 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584
///***************************************************
// *               ATTRIBUTE HANDLER                 *
// ***************************************************/
//
//template <typename T>
//T& AttributeHandler_IHM<T>::operator[](Dart d)
//{
//	ImplicitHierarchicalMap3* m = reinterpret_cast<ImplicitHierarchicalMap3*>(this->m_map) ;
//	assert(m->m_dartLevel[d] <= m->m_curLevel || !"Access to a dart introduced after current level") ;
//	assert(m->vertexInsertionLevel(d) <= m->m_curLevel || !"Access to the embedding of a vertex inserted after current level") ;
//
//	unsigned int orbit = this->getOrbit() ;
//	unsigned int nbSteps = m->m_curLevel - m->vertexInsertionLevel(d) ;
//	unsigned int index = m->getEmbedding(orbit, d) ;
//
//	if(index == EMBNULL)
//	{
//		index = m->embedNewCell(orbit, d) ;
//		m->m_nextLevelCell[orbit]->operator[](index) = EMBNULL ;
//	}
//
//	AttributeContainer& cont = m->getAttributeContainer(orbit) ;
//	unsigned int step = 0 ;
//	while(step < nbSteps)
//	{
//		step++ ;
//		unsigned int nextIdx = m->m_nextLevelCell[orbit]->operator[](index) ;
//		if (nextIdx == EMBNULL)
//		{
//			nextIdx = m->newCell(orbit) ;
//			m->copyCell(orbit, nextIdx, index) ;
//			m->m_nextLevelCell[orbit]->operator[](index) = nextIdx ;
//			m->m_nextLevelCell[orbit]->operator[](nextIdx) = EMBNULL ;
//			cont.refLine(index) ;
//		}
//		index = nextIdx ;
//	}
//	return this->m_attrib->operator[](index);
//}
//
//template <typename T>
//const T& AttributeHandler_IHM<T>::operator[](Dart d) const
//{
//	ImplicitHierarchicalMap3* m = reinterpret_cast<ImplicitHierarchicalMap3*>(this->m_map) ;
//	assert(m->m_dartLevel[d] <= m->m_curLevel || !"Access to a dart introduced after current level") ;
//	assert(m->vertexInsertionLevel(d) <= m->m_curLevel || !"Access to the embedding of a vertex inserted after current level") ;
//
//	unsigned int orbit = this->getOrbit() ;
//	unsigned int nbSteps = m->m_curLevel - m->vertexInsertionLevel(d) ;
//	unsigned int index = m->getEmbedding(orbit, d) ;
//
//	unsigned int step = 0 ;
//	while(step < nbSteps)
//	{
//		step++ ;
//		unsigned int next = m->m_nextLevelCell[orbit]->operator[](index) ;
//		if(next != EMBNULL) index = next ;
//		else break ;
//	}
//	return this->m_attrib->operator[](index);
//}
585 586 587 588 589 590

} //namespace IHM

} //namespace Algo

} //namespace CGoGN