ihm3.h 8.47 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 29 30 31
//#include "Topology/map/map3.h"
//#include "Topology/generic/embeddedMap3.h"
//#include "Container/attributeContainer.h"
#include "Topology/map/embeddedMap3.h"
32 33 34 35 36 37 38

namespace CGoGN
{

namespace Algo
{

untereiner's avatar
untereiner committed
39
namespace IHM
40 41 42 43
{

template<typename T> class AttributeHandler_IHM ;

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

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
58
	AttributeMultiVector<unsigned int>* m_nextLevelCell[NB_ORBITS] ;
59 60 61 62 63 64 65 66 67 68 69 70 71 72 73

public:
	ImplicitHierarchicalMap3() ;

	~ImplicitHierarchicalMap3() ;

	void init() ;

	/***************************************************
	 *             ATTRIBUTES MANAGEMENT               *
	 ***************************************************/

	template <typename T>
	AttributeHandler_IHM<T> addAttribute(unsigned int orbit, const std::string& nameAttr) ;

untereiner's avatar
untereiner committed
74 75 76 77
	template <typename T>
	AttributeHandler_IHM<T> getAttribute(unsigned int orbit, const std::string& nameAttr) ;


78 79 80 81 82 83 84 85 86 87
	/***************************************************
	 *                 MAP TRAVERSAL                   *
	 ***************************************************/

	virtual Dart newDart() ;

	Dart phi1(Dart d) ;

	Dart phi_1(Dart d) ;

88 89
	Dart phi2(Dart d) ;

90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109
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);

	virtual Dart begin() ;

	virtual Dart end() ;

	virtual void next(Dart& d) ;

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

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

114 115
	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) ;
116

117 118
	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) ;
119

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

untereiner's avatar
untereiner committed
122 123 124 125 126 127 128 129 130 131

	/****************************************************
	 * 				EMBEDDED FUNCTIONS					*
	 ****************************************************/
//	virtual void cutEdge(Dart d);
//
//	virtual void splitFace(Dart d, Dart e);
//
//	virtual void sewVolumes(Dart d, Dart e);

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
	/***************************************************
	 *              LEVELS MANAGEMENT                  *
	 ***************************************************/

	unsigned int getCurrentLevel() ;

	void setCurrentLevel(unsigned int l) ;

	unsigned int getMaxLevel() ;

	unsigned int getDartLevel(Dart d) ;

	void setDartLevel(Dart d, unsigned int i) ;

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

	/**
	 * Give a new unique id to all the edges of the map
	 */
	void initEdgeId() ;

	/**
	 * Return the next available edge id
	 */
	unsigned int getNewEdgeId() ;

160 161 162
	/**
	 * Return the id of the edge of d
	 */
163 164
	unsigned int getEdgeId(Dart d) ;

165 166 167 168
	/**
	 * Set an edge id to all darts from an orbit of d
	 */
	//TODO changer l'ordre des parametres
169 170 171 172 173
	void setEdgeId(Dart d, unsigned int i, unsigned int orbit);

	/***************************************************
	 *             FACE ID MANAGEMENT                  *
	 ***************************************************/
174 175 176 177

	/**
	 * Give a new unique id to all the faces of the map
	 */
178 179 180 181 182 183 184
	void initFaceId() ;

	/**
	 * Return the next available face id
	 */
	unsigned int getNewFaceId() ;

185 186 187
	/**
	 * Return the id of the face of d
	 */
188 189
	unsigned int getFaceId(Dart d) ;

190 191 192 193
	/**
	 * Set a face id to all darts from an orbit of d
	 */
	//TODO changer l'ordre des parametres
194 195
	void setFaceId(Dart d, unsigned int i, unsigned int orbit);

196 197
	void setFaceId(unsigned int orbit, Dart d);

198 199 200 201 202 203 204 205 206 207 208 209 210 211 212
	/***************************************************
	 *               CELLS INFORMATION                 *
	 ***************************************************/

	/**
	 * Return the level of insertion of the vertex of d
	 */
	unsigned int vertexInsertionLevel(Dart d) ;

	/**
	 * Return the level of the edge of d in the current level map
	 */
	unsigned int edgeLevel(Dart d) ;

	/**
213
	 * Return the level of the face of d in the current level map
214 215 216 217
	 */
	unsigned int faceLevel(Dart d);

	/**
218
	 * Return the level of the volume of d in the current level map
219 220 221 222
	 */
	unsigned int volumeLevel(Dart d);

	/**
223
	 * Return the oldest dart of the face of d in the current level map
224 225 226 227
	 */
	Dart faceOldestDart(Dart d);

	/**
228
	 * Return the oldest dart of the volume of d in the current level map
229 230 231 232 233 234 235 236 237 238
	 */
	Dart volumeOldestDart(Dart d);

	/**
	 * Return true if the edge of d in the current level map
	 * has already been subdivided to the next level
	 */
	bool edgeIsSubdivided(Dart d) ;

	/**
239 240
	 * Return true if the face of d in the current level map
	 * has already been subdivided to the next level
241 242 243 244
	 */
	bool faceIsSubdivided(Dart d) ;

	/**
245 246
	 * Return true if the volume of d in the current level map
	 * has already been subdivided to the next level
247 248
	 */
	bool volumeIsSubdivided(Dart d);
untereiner's avatar
untereiner committed
249 250 251 252 253 254 255 256 257

	/**
	 * 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
	 */
	bool edgeCanBeCoarsened(Dart d);

258 259 260 261 262
	/**
	 *
	 */
	bool faceCanBeCoarsened(Dart d);

untereiner's avatar
untereiner committed
263 264 265 266 267 268 269 270 271 272
	/**
	 *
	 */
	bool faceIsSubdividedOnce(Dart d);

	/**
	 *
	 */
	bool volumeIsSubdividedOnce(Dart d);

273 274 275 276
	/**
	 *
	 */
	bool neighborhoodLevelDiffersByOne(Dart d);
untereiner's avatar
untereiner committed
277

278 279 280 281
	/**
	 * wired !!!
	 */
	bool coarsenNeighborhoodLevelDiffersByOne(Dart d);
282 283 284 285 286 287 288 289 290 291 292
} ;

template <typename T>
class AttributeHandler_IHM : public AttributeHandler<T>
{
public:
	typedef T DATA_TYPE ;

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

untereiner's avatar
untereiner committed
293
	AttributeHandler_IHM(GenericMap* m, AttributeMultiVector<T>* amv) : AttributeHandler<T>(m, amv)
294 295
	{}

Sylvain Thery's avatar
Sylvain Thery committed
296
	AttributeMultiVector<T>* getDataVector() const
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
	{
		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) ;
	}
} ;

} //namespace IHM

} //namespace Algo

} //namespace CGoGN

#include "Algo/ImplicitHierarchicalMesh/ihm3.hpp"

#endif