simplifMesh.h 7.68 KB
Newer Older
Pierre Kraemer's avatar
Pierre Kraemer committed
1 2 3
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
4
* Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg           *
Pierre Kraemer's avatar
Pierre Kraemer committed
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.unistra.fr/                                           *
Pierre Kraemer's avatar
Pierre Kraemer committed
21 22 23 24 25 26 27 28 29 30 31 32 33 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 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 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 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 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 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 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 308 309 310 311 312 313 314 315 316 317 318 319 320 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
* Contact information: cgogn@unistra.fr                                        *
*                                                                              *
*******************************************************************************/

#include <map>
#include "Container/fakeAttribute.h"
#include "Algo/Geometry/basic.h"
#include "Topology/generic/autoAttributeHandler.h"

namespace CGoGN
{

namespace Algo
{

namespace Decimation
{

/**
 * Example of Edge_Critera class parameter
 * Will be used as edge embedding 
 * 
 * Necessary methods are:
 *  - constructor from dart 
 *  - getDart
 * - getKey -> float
 *  - removingAllowed
 *  - newPosition
 */
template <typename PFP>
class EdgeCrit
{
public:
	typedef typename PFP::MAP MAP;


protected:
	Dart m_dart;
	bool m_dirty;

public:
	/**
	 * Constructor (compute length on the fly)
	 * @param d a dart of the edge
	 */
	EdgeCrit(): m_dirty(false) {}

	virtual float computeKey(typename PFP::MAP& map, typename PFP::TVEC3& posi) const = 0;

	/**
	 * MUST BE IMPLEMENTED
	 * return the dart
	 */
	virtual Dart getDart() const  = 0;

	/**
	 * MUST BE IMPLEMENTED
	 * criteria test to allow removing
	 */
	virtual bool removingAllowed() const  = 0;

	/**
	 * MUST BE IMPLEMENTED
	 * compute new vertex position: here middle of edge
	 */
	virtual typename PFP::VEC3 newPosition(typename PFP::MAP& map, typename PFP::TVEC3& posi) const = 0;


	/**
	 * MUST BE IMPLEMENTED
	 * test if criteria is taged as dirty
	 */
	virtual bool isDirty() const = 0;

	/**
	 * MUST BE IMPLEMENTED
	 * tag the criteria as dirty (no more usable)
	 */
	virtual void tagDirty() = 0;

	/**
	 * Create
	 */
	virtual EdgeCrit* create(Dart d) const = 0;
};


/**
 * Example of Edge_Critera class parameter
 * Will be used as edge embedding
 *
 * Necessary methods are:
 *  - constructor from dart
 *  - getDart
 *  - getKey -> float
 *  - removingAllowed
 *  - newPosition
 */
template <typename PFP>
class EdgeCrit_LengthMiddle : public EdgeCrit<PFP>
{
public:
	typedef typename PFP::MAP MAP;

public:
	/**
	 * Constructor (compute length on the fly)
	 * @param d a dart of the edge
	 */
	EdgeCrit_LengthMiddle(): EdgeCrit<PFP>()
	{}

	EdgeCrit_LengthMiddle(Dart d) :	EdgeCrit<PFP>()
	{
		this->m_dart = d;
	}

	float computeKey(typename PFP::MAP& map, typename PFP::TVEC3& posi) const
	{
		typename PFP::VEC3 PQ = Algo::Geometry::vectorOutOfDart<PFP>(map, this->m_dart, posi);
		return PQ.norm2();
	}
	
	/**
	 * MUST BE IMPLEMENTED
	 * return the dart
	 */ 
	Dart getDart() const { return this->m_dart; }
	
	/**
	 * MUST BE IMPLEMENTED
	 * criteria test to allow removing
	 */ 
	bool removingAllowed() const { return true; }
	
	/**
	 * MUST BE IMPLEMENTED
	 * compute new vertex position: here middle of edge
	 */
	typename PFP::VEC3 newPosition(typename PFP::MAP& map, typename PFP::TVEC3& posi) const
	{
		const typename PFP::VEC3& p1 = posi[this->m_dart];
		const typename PFP::VEC3& p2 = posi[map.phi1(this->m_dart)];
		return typename PFP::REAL(0.5) * (p1 + p2);
	}
	
	/**
	 * MUST BE IMPLEMENTED
	 * test if criteria is taged as dirty
	 */
	bool isDirty() const
	{
		return this->m_dirty;
	}

	/**
	 * MUST BE IMPLEMENTED
	 * tag the criteria as dirty (no more usable)
	 */
	void tagDirty() 
	{
		this->m_dirty = true;
	}

	/**
	 * Create
	 */
	EdgeCrit<PFP>* create(Dart d) const
	{
		return new EdgeCrit_LengthMiddle(d);
	}
};

/**
 * Example of Edge_Critera class parameter
 * Will be used as edge embedding
 *
 * Necessary methods are:
 *  - constructor from dart
 *  - getDart
 *  - getKey -> float
 *  - removingAllowed
 *  - newPosition
 */
template <typename PFP>
class EdgeCrit_LengthFirst : public EdgeCrit<PFP>
{
public:
	typedef typename PFP::MAP MAP;
	
public:
	/**
	 * Constructor (compute length on the fly)
	 * @param d a dart of the edge
	 */
	EdgeCrit_LengthFirst(): EdgeCrit<PFP>() {}

	EdgeCrit_LengthFirst(Dart d) :
		EdgeCrit<PFP>() {this->m_dart = d;}

	float computeKey(typename PFP::MAP& map, typename PFP::TVEC3& posi) const
	{
		typename PFP::VEC3 PQ = Algo::Geometry::vectorOutOfDart<PFP>(map, this->m_dart, posi);
		return PQ.norm2();
	}

	/**
	 * MUST BE IMPLEMENTED
	 * return the dart
	 */
	Dart getDart() const { return this->m_dart; }

	/**
	 * MUST BE IMPLEMENTED
	 * criteria test to allow removing
	 */
	bool removingAllowed() const { return true; }

	/**
	 * MUST BE IMPLEMENTED
	 * compute new vertex position: here middle of edge
	 */
	typename PFP::VEC3 newPosition(typename PFP::MAP& map, typename PFP::TVEC3& posi) const
	{
		const typename PFP::VEC3& p1 = posi[this->m_dart];
		const typename PFP::VEC3& p2 = posi[map.phi1(this->m_dart)];
		return typename PFP::REAL(0.9)*p1 + typename PFP::REAL(0.1)*p2 ;
	}

	/**
	 * MUST BE IMPLEMENTED
	 * test if criteria is taged as dirty
	 */
	bool isDirty() const
	{
		return this->m_dirty;
	}

	/**
	 * MUST BE IMPLEMENTED
	 * tag the criteria as dirty (no more usable)
	 */
	void tagDirty()
	{
		this->m_dirty = true;
	}

	/**
	 * Create
	 */
	EdgeCrit<PFP>* create(Dart d) const
	{
		return new EdgeCrit_LengthFirst(d);
	}
};


template <typename PFP>
class SimplifTrian
{
public:
	typedef typename PFP::MAP MAP;

	typedef EdgeCrit<PFP> CRIT;

private:
	MAP& m_map;

	CRIT* m_crit;

	typename PFP::TVEC3 m_positions;

	// map des critères (donc trié)
	std::multimap<float, CRIT*> m_edgeCrit;

	typedef typename std::multimap<float, CRIT*>::iterator CRIT_IT;

	typedef NoMathIONameAttribute<CRIT_IT> CRIT_IT_ATT;

	// attribut d'arête
	AutoAttributeHandler<CRIT_IT_ATT> m_edgeEmb;

	// attribut de sommet (valence)
	AutoAttributeHandler<unsigned int> m_valences;

	AttributeHandler<Mark> m_edgeMarkers;

	CellMarker m_protectMarker;

	unsigned int m_nbTriangles;

	unsigned int m_nbWanted;

	unsigned int m_passe;

public:
	SimplifTrian(MAP& the_map, unsigned int idPos, CRIT* cr);

	void changeCriteria(CRIT* cr);

	void simplifUntil(unsigned int nbWantedTriangles);

	~SimplifTrian();

	void updateCriterias(Dart d);

	bool edgeIsCollapsible(Dart d);

	Dart edgeCollapse(Dart d, typename PFP::VEC3 &);

	void computeVerticesValences(bool gc);

protected:
	CRIT* getCrit(Dart d)
	{
		return m_edgeEmb[d]->second;
	}

};

} //namespace Decimation

} //namespace Algo

} //namespace CGoGN

#include "simplifMesh.hpp"