ihm3.h 8.17 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
{

untereiner's avatar
untereiner committed
39
//template<typename T> class AttributeHandler_IHM ;
40

41
class ImplicitHierarchicalMap3 : public EmbeddedMap3
42
{
untereiner's avatar
untereiner committed
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 62 63 64 65 66 67

public:
	ImplicitHierarchicalMap3() ;

	~ImplicitHierarchicalMap3() ;

	void init() ;

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

untereiner's avatar
untereiner committed
68 69
	//template <typename T>
	//AttributeHandler_IHM<T> addAttribute(unsigned int orbit, const std::string& nameAttr) ;
70

untereiner's avatar
untereiner committed
71 72
	//template <typename T>
	//AttributeHandler_IHM<T> getAttribute(unsigned int orbit, const std::string& nameAttr) ;
untereiner's avatar
untereiner committed
73 74


75 76 77 78 79 80 81 82 83 84
	/***************************************************
	 *                 MAP TRAVERSAL                   *
	 ***************************************************/

	virtual Dart newDart() ;

	Dart phi1(Dart d) ;

	Dart phi_1(Dart d) ;

85 86
	Dart phi2(Dart d) ;

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

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

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

111 112
	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) ;
113

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

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

untereiner's avatar
untereiner committed
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
	/***************************************************
	 *              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() ;

148 149 150
	/**
	 * Return the id of the edge of d
	 */
151 152
	unsigned int getEdgeId(Dart d) ;

153 154 155 156
	/**
	 * Set an edge id to all darts from an orbit of d
	 */
	//TODO changer l'ordre des parametres
157 158 159 160 161
	void setEdgeId(Dart d, unsigned int i, unsigned int orbit);

	/***************************************************
	 *             FACE ID MANAGEMENT                  *
	 ***************************************************/
162 163 164 165

	/**
	 * Give a new unique id to all the faces of the map
	 */
166 167 168 169 170 171 172
	void initFaceId() ;

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

173 174 175
	/**
	 * Return the id of the face of d
	 */
176 177
	unsigned int getFaceId(Dart d) ;

178 179 180 181
	/**
	 * Set a face id to all darts from an orbit of d
	 */
	//TODO changer l'ordre des parametres
182 183
	void setFaceId(Dart d, unsigned int i, unsigned int orbit);

184 185
	void setFaceId(unsigned int orbit, Dart d);

186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
	/***************************************************
	 *               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) ;

	/**
201
	 * Return the level of the face of d in the current level map
202 203 204 205
	 */
	unsigned int faceLevel(Dart d);

	/**
206
	 * Return the level of the volume of d in the current level map
207 208 209 210
	 */
	unsigned int volumeLevel(Dart d);

	/**
211
	 * Return the oldest dart of the face of d in the current level map
212 213 214 215
	 */
	Dart faceOldestDart(Dart d);

	/**
216
	 * Return the oldest dart of the volume of d in the current level map
217 218 219 220 221 222 223 224 225 226
	 */
	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) ;

	/**
227 228
	 * Return true if the face of d in the current level map
	 * has already been subdivided to the next level
229 230 231 232
	 */
	bool faceIsSubdivided(Dart d) ;

	/**
233 234
	 * Return true if the volume of d in the current level map
	 * has already been subdivided to the next level
235 236
	 */
	bool volumeIsSubdivided(Dart d);
untereiner's avatar
untereiner committed
237 238 239 240 241 242 243 244 245

	/**
	 * 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);

246 247 248 249 250
	/**
	 *
	 */
	bool faceCanBeCoarsened(Dart d);

untereiner's avatar
untereiner committed
251 252 253 254 255 256 257 258 259 260
	/**
	 *
	 */
	bool faceIsSubdividedOnce(Dart d);

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

261 262 263 264
	/**
	 *
	 */
	bool neighborhoodLevelDiffersByOne(Dart d);
untereiner's avatar
untereiner committed
265

266 267 268 269
	/**
	 * wired !!!
	 */
	bool coarsenNeighborhoodLevelDiffersByOne(Dart d);
270 271
} ;

untereiner's avatar
untereiner committed
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
//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) ;
//	}
//} ;
308 309 310 311 312 313 314 315 316 317

} //namespace IHM

} //namespace Algo

} //namespace CGoGN

#include "Algo/ImplicitHierarchicalMesh/ihm3.hpp"

#endif