ihm2.h 9.09 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg           *
*                                                                              *
* 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.           *
*                                                                              *
* Web site: http://cgogn.unistra.fr/                                           *
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#ifndef __IMPLICIT_HIERARCHICAL_MAP2__
#define __IMPLICIT_HIERARCHICAL_MAP2__

#include "Topology/map/embeddedMap2.h"

namespace CGoGN
{

template<typename T, unsigned int ORBIT> class AttributeHandler_IHM ;

35
typedef EmbeddedMap2::TOPO_MAP TOPO_MAP;
Pierre Kraemer's avatar
Pierre Kraemer committed
36

37 38 39 40 41 42 43 44 45
class ImplicitHierarchicalMap2 : public EmbeddedMap2
{
	template<typename T, unsigned int ORBIT> friend class AttributeHandler_IHM ;

private:
	unsigned int m_curLevel ;
	unsigned int m_maxLevel ;
	unsigned int m_idCount ;

46 47
	DartAttribute<unsigned int, ImplicitHierarchicalMap2> m_dartLevel ;
	DartAttribute<unsigned int, ImplicitHierarchicalMap2> m_edgeId ;
48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65

	AttributeMultiVector<unsigned int>* m_nextLevelCell[NB_ORBITS] ;

public:
	ImplicitHierarchicalMap2() ;

	~ImplicitHierarchicalMap2() ;

	//!
	/*!
	 *
	 */
	void update_topo_shortcuts();

	//!
	/*!
	 *
	 */
66
	void initImplicitProperties();
67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87

	/**
	 * clear the map
	 * @param remove attrib remove attribute (not only clear the content)
	 */
	void clear(bool removeAttrib);

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

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

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

	/***************************************************
	 *                 MAP TRAVERSAL                   *
	 ***************************************************/

88
	inline Dart newDart() ;
89

90
	inline Dart phi1(Dart d) const ;
91

92
	inline Dart phi_1(Dart d) const ;
93

94
	inline Dart phi2(Dart d) const ;
95

96
	inline Dart alpha0(Dart d) const ;
97

98
	inline Dart alpha1(Dart d) const ;
99

100
	inline Dart alpha_1(Dart d) const ;
101

102
	inline Dart begin() const ;
103

104
	inline Dart end() const ;
105

106
	inline void next(Dart& d) const ;
107

108 109
//	template <unsigned int ORBIT, typename FUNC>
//	void foreach_dart_of_orbit(Cell<ORBIT> c, FUNC f, unsigned int thread = 0) const ;
110
	template <unsigned int ORBIT, typename FUNC>
111
	void foreach_dart_of_orbit(Cell<ORBIT> c, const FUNC& f, unsigned int thread = 0) const ;
112

113 114
	template <typename FUNC>
	void foreach_dart_of_vertex(Dart d, FUNC& f, unsigned int thread = 0) const;
115

116 117
	template <typename FUNC>
	void foreach_dart_of_edge(Dart d, FUNC& f, unsigned int thread = 0) const ;
118

119 120
	template <typename FUNC>
	void foreach_dart_of_oriented_face(Dart d, FUNC& f, unsigned int thread = 0) const ;
121

122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
	template <typename FUNC>
	void foreach_dart_of_face(Dart d, FUNC& f, unsigned int thread = 0)  const;

	template <typename FUNC>
	void foreach_dart_of_oriented_volume(Dart d, FUNC& f, unsigned int thread = 0) const ;

	template <typename FUNC>
	void foreach_dart_of_volume(Dart d, FUNC& f, unsigned int thread = 0) const ;

	template <typename FUNC>
	void foreach_dart_of_vertex1(Dart d, FUNC& f, unsigned int thread = 0) const;

	template <typename FUNC>
	void foreach_dart_of_edge1(Dart d, FUNC& f, unsigned int thread = 0) const;

	template <typename FUNC>
	void foreach_dart_of_cc(Dart d, FUNC& f, unsigned int thread = 0) const ;
139 140 141 142 143 144 145

	/***************************************************
	 *               MAP MANIPULATION                  *
	 ***************************************************/

	void splitFace(Dart d, Dart e) ;

146 147
    unsigned int vertexDegree(Dart d);

148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165
	/***************************************************
	 *              LEVELS MANAGEMENT                  *
	 ***************************************************/

	unsigned int getCurrentLevel() ;

	void setCurrentLevel(unsigned int l) ;

	void incCurrentLevel();

	void decCurrentLevel();

	unsigned int getMaxLevel() ;

	unsigned int getDartLevel(Dart d) ;

	void setDartLevel(Dart d, unsigned int i) ;

166 167
	void setMaxLevel(unsigned int l);

168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185
	/***************************************************
	 *             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() ;

	unsigned int getEdgeId(Dart d) ;

	void setEdgeId(Dart d, unsigned int i) ;

186 187 188 189
	unsigned int getTriRefinementEdgeId(Dart d);

	unsigned int getQuadRefinementEdgeId(Dart d);

190 191 192 193
	/***************************************************
	 *               CELLS INFORMATION                 *
	 ***************************************************/

194 195 196 197 198 199 200
    /**
     * @brief faceDegree
     * @param d
     * @return
     */
    unsigned int faceDegree(Dart d);

201 202 203 204 205
	/**
	 * Return the level of insertion of the vertex of d
	 */
	unsigned int vertexInsertionLevel(Dart d) ;

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
//	/**
//	 * Return the level of the edge of d in the current level map
//	 */
//	unsigned int edgeLevel(Dart d) ;

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

//	/**
//	 * Given the face of d in the current level map,
//	 * return a level 0 dart of its origin face
//	 */
//	Dart faceOrigin(Dart d) ;

//	/**
//	 * Return the oldest dart of the face of d in the current level map
//	 */
//	Dart faceOldestDart(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) ;

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

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

//	/**
//	 * Return true if the face of d in the current level map
//	 * is subdivided to the next level
//	 * and none of its resulting faces is in turn subdivided to the next level
//	 */
//	bool faceIsSubdividedOnce(Dart d) ;
253 254 255
} ;

template <typename T, unsigned int ORBIT>
256
class AttributeHandler_IHM : public AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>
257 258 259 260
{
public:
	typedef T DATA_TYPE ;

261
	AttributeHandler_IHM() : AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>()
262 263
	{}

264
	AttributeHandler_IHM(ImplicitHierarchicalMap2* m, AttributeMultiVector<T>* amv) : AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>(m, amv)
265 266 267 268
	{}

	AttributeMultiVector<T>* getDataVector() const
	{
269
		return AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>::getDataVector() ;
270 271 272 273
	}

	bool isValid() const
	{
274
		return AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>::isValid() ;
275 276 277 278 279 280 281 282
	}

	T& operator[](Dart d) ;

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

	T& operator[](unsigned int a)
	{
283
		return AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>::operator[](a) ;
284 285 286 287
	}

	const T& operator[](unsigned int a) const
	{
288
		return AttributeHandler<T, ORBIT, ImplicitHierarchicalMap2>::operator[](a) ;
289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
	}
} ;

template <typename T>
class VertexAttribute_IHM : public AttributeHandler_IHM<T, VERTEX>
{
public:
	VertexAttribute_IHM() : AttributeHandler_IHM<T, VERTEX>() {}
	VertexAttribute_IHM(const AttributeHandler_IHM<T, VERTEX>& ah) : AttributeHandler_IHM<T, VERTEX>(ah) {}
	VertexAttribute_IHM<T>& operator=(const AttributeHandler_IHM<T, VERTEX>& ah) { this->AttributeHandler_IHM<T, VERTEX>::operator=(ah); return *this; }
};


} //namespace CGoGN

#include "Topology/ihmap/ihm2.hpp"

#endif