ihm3.h 8.91 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
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#ifndef __IMPLICIT_HIERARCHICAL_MAP3__
#define __IMPLICIT_HIERARCHICAL_MAP3__

28
#include "Topology/map/embeddedMap3.h"
29 30 31 32 33 34 35

namespace CGoGN
{

namespace Algo
{

untereiner's avatar
untereiner committed
36
namespace IHM
37 38
{

39
template<typename T> class AttributeHandler_IHM ;
40

41
class ImplicitHierarchicalMap3 : public EmbeddedMap3
42
{
43
	template<typename T> friend class AttributeHandler_IHM ;
44 45 46 47 48 49 50 51 52 53 54

public:
	unsigned int m_curLevel ;
	unsigned int m_maxLevel ;
	unsigned int m_edgeIdCount ;
	unsigned int m_faceIdCount;

	AttributeHandler<unsigned int> m_dartLevel ;
	AttributeHandler<unsigned int> m_edgeId ;
	AttributeHandler<unsigned int> m_faceId ;

Sylvain Thery's avatar
Sylvain Thery committed
55
	AttributeMultiVector<unsigned int>* m_nextLevelCell[NB_ORBITS] ;
56 57 58 59 60 61

public:
	ImplicitHierarchicalMap3() ;

	~ImplicitHierarchicalMap3() ;

62 63 64 65
	//!
	/*!
	 *
	 */
66 67
	void init() ;

68 69 70
	/*! @name Attributes Management
	 *  To handles Attributes for each level of an implicit 3-map
	 *************************************************************************/
71

72 73 74 75 76 77 78
	//@{
	//!
	/*!
	 *
	 */
	template <typename T>
	AttributeHandler_IHM<T> addAttribute(unsigned int orbit, const std::string& nameAttr) ;
untereiner's avatar
untereiner committed
79

80 81 82 83 84 85 86
	//!
	/*!
	 *
	 */
	template <typename T>
	AttributeHandler_IHM<T> getAttribute(unsigned int orbit, const std::string& nameAttr) ;
	//@}
untereiner's avatar
untereiner committed
87

88 89 90
	/*! @name Basic Topological Operators
	 *  Redefinition of the basic topological operators
	 *************************************************************************/
91

92
	//@{
93 94 95 96 97 98
	virtual Dart newDart() ;

	Dart phi1(Dart d) ;

	Dart phi_1(Dart d) ;

99 100
	Dart phi2(Dart d) ;

101 102 103 104 105 106 107 108 109 110 111 112 113
private:
	Dart phi2bis(Dart d) ;

public:
	Dart phi3(Dart d);

	Dart alpha0(Dart d);

	Dart alpha1(Dart d);

	Dart alpha2(Dart d);

	Dart alpha_2(Dart d);
114
	//@}
115

116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160
//	/*! @name Topological Operators with Cells id management
//	 *  Topological operations on Hierarchical Implicit 3-maps
//	 *************************************************************************/
//
//	//@{
//	//!
//	/*!
//	 *
//	 */
//	virtual Dart cutEdge(Dart d);
//
//	//!
//	/*!
//	 *
//	 */
//	virtual bool uncutEdge(Dart d);
//
//	//!
//	/*!
//	 *
//	 */
//	virtual void splitFace(Dart d, Dart e);
//
//	//!
//	/*!
//	 *
//	 */
//	virtual void sewVolumes(Dart d, Dart e, bool withBoundary = true);
//
//	//!
//	/*!
//	 *
//	 */
//	virtual void splitVolume(std::vector<Dart>& vd);
//	//@}

	/*! @name Levels Management
	 *  Operations to manage the levels of an Implicit Hierarchical 3-map
	 *************************************************************************/

	//@{
	//!
	/*!
	 *
	 */
161 162
	unsigned int getCurrentLevel() ;

163 164 165 166
	//!
	/*!
	 *
	 */
167 168
	void setCurrentLevel(unsigned int l) ;

169 170 171 172
	//!
	/*!
	 *
	 */
173 174
	unsigned int getMaxLevel() ;

175 176 177 178
	//!
	/*!
	 *
	 */
179 180
	unsigned int getDartLevel(Dart d) ;

181 182 183 184
	//!
	/*!
	 *
	 */
185
	void setDartLevel(Dart d, unsigned int i) ;
186
	//@}
187

188 189 190
	/*! @name Id Management
	 * Operations to manage the ids of edges and faces
	 *************************************************************************/
191

192 193 194
	//@{
	//! Give a new unique id to all the edges of the map
	/*!
195 196 197
	 */
	void initEdgeId() ;

198 199
	//! Return the next available edge id
	/*!
200 201 202
	 */
	unsigned int getNewEdgeId() ;

203 204
	//! Return the id of the edge of d
	/*!
205
	 */
206 207
	unsigned int getEdgeId(Dart d) ;

208 209
	//! Set an edge id to all darts from an orbit of d
	/*!
210
	 */
211 212
	void setEdgeId(Dart d, unsigned int i, unsigned int orbit); //TODO a virer
	void setEdgeId(Dart d, unsigned int i);
213

214 215
	//! Give a new unique id to all the faces of the map
	/*!
216
	 */
217 218
	void initFaceId() ;

219 220
	//! Return the next available face id
	/*!
221 222 223
	 */
	unsigned int getNewFaceId() ;

224 225
	//! Return the id of the face of d
	/*!
226
	 */
227 228
	unsigned int getFaceId(Dart d) ;

229 230
	//! Set a face id to all darts from an orbit of d
	/*!
231
	 */
232
	void setFaceId(Dart d, unsigned int i, unsigned int orbit); //TODO a virer
233
	void setFaceId(unsigned int orbit, Dart d);
234
	//@}
235

236 237 238
	/*! @name Cells Information
	 * Operations to manage the cells informations :
	 *************************************************************************/
239

240 241 242
	//@{
	//! Return the level of insertion of the vertex of d
	/*!
243 244 245
	 */
	unsigned int vertexInsertionLevel(Dart d) ;

246 247
	//! Return the level of the edge of d in the current level map
	/*!
248 249 250
	 */
	unsigned int edgeLevel(Dart d) ;

251 252
	//! Return the level of the face of d in the current level map
	/*!
253 254 255
	 */
	unsigned int faceLevel(Dart d);

256 257
	//! Return the level of the volume of d in the current level map
	/*!
258 259 260
	 */
	unsigned int volumeLevel(Dart d);

261 262
	//! Return the oldest dart of the face of d in the current level map
	/*!
263 264 265
	 */
	Dart faceOldestDart(Dart d);

266 267
	//! Return the oldest dart of the volume of d in the current level map
	/*!
268 269 270
	 */
	Dart volumeOldestDart(Dart d);

271 272 273
	//! Return true if the edge of d in the current level map
	//! has already been subdivided to the next level
	/*!
274 275 276
	 */
	bool edgeIsSubdivided(Dart d) ;

277 278 279
	//! Return true if the face of d in the current level map
	//! has already been subdivided to the next level
	/*!
280 281 282
	 */
	bool faceIsSubdivided(Dart d) ;

283 284 285
	//! Return true if the volume of d in the current level map
	//! has already been subdivided to the next level
	/*!
286 287
	 */
	bool volumeIsSubdivided(Dart d);
untereiner's avatar
untereiner committed
288

289 290 291 292 293
	//! Return true if the edge of d in the current level map
	//! is subdivided to the next level,
	//! none of its resulting edges is in turn subdivided to the next level
	//! and the middle vertex is of degree 2
	/*!
untereiner's avatar
untereiner committed
294 295 296
	 */
	bool edgeCanBeCoarsened(Dart d);

297 298
	//!
	/*!
299 300 301
	 */
	bool faceCanBeCoarsened(Dart d);

302 303
	//!
	/*!
untereiner's avatar
untereiner committed
304 305 306
	 */
	bool faceIsSubdividedOnce(Dart d);

307 308
	//!
	/*!
untereiner's avatar
untereiner committed
309 310 311
	 */
	bool volumeIsSubdividedOnce(Dart d);

312 313
	//!
	/*!
314 315
	 */
	bool neighborhoodLevelDiffersByOne(Dart d);
untereiner's avatar
untereiner committed
316

317 318
	//! wired !!!
	/*!
319 320
	 */
	bool coarsenNeighborhoodLevelDiffersByOne(Dart d);
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
	//@}

	/*! @name Cell Functors
	 * Redefition of the 3-maps map traversor
	 *************************************************************************/

	//@{
	virtual Dart begin() ;

	virtual Dart end() ;

	virtual void next(Dart& d) ;

	virtual bool foreach_dart_of_vertex(Dart d, FunctorType& f, unsigned int thread = 0) ;

	virtual bool foreach_dart_of_edge(Dart d, FunctorType& f, unsigned int thread = 0) ;

	bool foreach_dart_of_oriented_face(Dart d, FunctorType& f, unsigned int thread = 0);
	virtual bool foreach_dart_of_face(Dart d, FunctorType& f, unsigned int thread = 0) ;

	bool foreach_dart_of_oriented_volume(Dart d, FunctorType& f, unsigned int thread = 0);
	virtual bool foreach_dart_of_volume(Dart d, FunctorType& f, unsigned int thread = 0) ;

	virtual bool foreach_dart_of_cc(Dart d, FunctorType& f, unsigned int thread = 0) ;
	//@}


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
template <typename T>
class AttributeHandler_IHM : public AttributeHandler<T>
{
public:
	typedef T DATA_TYPE ;

	AttributeHandler_IHM() : AttributeHandler<T>()
	{}

	AttributeHandler_IHM(GenericMap* m, AttributeMultiVector<T>* amv) : AttributeHandler<T>(m, amv)
	{}

	AttributeMultiVector<T>* getDataVector() const
	{
		return AttributeHandler<T>::getDataVector() ;
	}

	bool isValid() const
	{
		return AttributeHandler<T>::isValid() ;
	}

	T& operator[](Dart d) ;

	const T& operator[](Dart d) const ;

	T& operator[](unsigned int a)
	{
		return AttributeHandler<T>::operator[](a) ;
	}

	const T& operator[](unsigned int a) const
	{
		return AttributeHandler<T>::operator[](a) ;
	}
} ;
386 387 388 389 390 391 392 393 394 395

} //namespace IHM

} //namespace Algo

} //namespace CGoGN

#include "Algo/ImplicitHierarchicalMesh/ihm3.hpp"

#endif