approximator.hpp 6.83 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 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
/*******************************************************************************
* CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps  *
* version 0.1                                                                  *
* Copyright (C) 2009-2013, IGG Team, ICube, 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                                        *
*                                                                              *
*******************************************************************************/

namespace CGoGN
{

namespace Algo
{

namespace Surface
{

namespace Decimation
{

template <typename PFP, typename T, unsigned int ORBIT>
Approximator<PFP,T,ORBIT>::Approximator(MAP& m, std::vector<VertexAttribute<T>* > va, Predictor<PFP, T> * predictor) :
	ApproximatorGen<PFP>(m), m_predictor(predictor), m_attrV(va)
{
	const unsigned int& size = m_attrV.size() ;
	assert(size > 0 || !"Approximator: no attributes provided") ;

	m_approx.resize(size) ;
	m_detail.resize(size) ;
	m_app.resize(size) ;

	for (unsigned int i = 0 ; i < size ; ++i)
	{
		if (!m_attrV[i]->isValid())
			std::cerr << "Approximator Warning: attribute number " << i << " is not valid" << std::endl ;

		std::stringstream aname ;
		aname << "approx_" << m_attrV[i]->name() ;
		m_approx[i] = this->m_map.template addAttribute<T, ORBIT>(aname.str()) ;

		if(m_predictor)	// if predictors are associated to the approximator
		{				// create attributes to store the details needed for reconstruction
			std::stringstream dname ;
			dname << "detail_" << m_attrV[i]->name() ;
			m_detail[i] = this->m_map.template addAttribute<T, ORBIT>(dname.str()) ;
		}
	}
}

template <typename PFP, typename T, unsigned int ORBIT>
Approximator<PFP,T,ORBIT>::~Approximator()
{
Sylvain Thery's avatar
Sylvain Thery committed
69
//	std::cout << "Approximator<PFP,T,ORBIT>::~Approximator()" << std::endl ;
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
	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
	{
		this->m_map.template removeAttribute(m_approx[i]) ;
		if(m_predictor)
			this->m_map.template removeAttribute(m_detail[i]) ;
	}
}

template <typename PFP, typename T, unsigned int ORBIT>
const std::string&
Approximator<PFP,T,ORBIT>::getApproximatedAttributeName(unsigned int index) const
{
	return m_attrV[index]->name() ;
}

template <typename PFP, typename T, unsigned int ORBIT>
unsigned int
Approximator<PFP,T,ORBIT>::getNbApproximated() const
{
	return m_attrV.size() ;
}

template <typename PFP, typename T, unsigned int ORBIT>
void
Approximator<PFP,T,ORBIT>::saveApprox(Dart d)
{
	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
	{
		m_app[i] = m_approx[i][d] ;
	}
}

template <typename PFP, typename T, unsigned int ORBIT>
void
Approximator<PFP,T,ORBIT>::affectApprox(Dart d)
{
	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
	{
		m_attrV[i]->operator[](d) = m_app[i] ;
	}
}

template <typename PFP, typename T, unsigned int ORBIT>
const T&
Approximator<PFP,T,ORBIT>::getApprox(Dart d, unsigned int index) const
{
	return m_approx[index][d] ;
}

template <typename PFP, typename T, unsigned int ORBIT>
const VertexAttribute<T>&
Approximator<PFP,T,ORBIT>::getAttr(unsigned int index) const
{
	return *(m_attrV[index]) ;
}

template <typename PFP, typename T, unsigned int ORBIT>
VertexAttribute<T>&
Approximator<PFP,T,ORBIT>::getAttr(unsigned int index)
{
	return *(m_attrV[index]) ;
}

template <typename PFP, typename T, unsigned int ORBIT>
std::vector<T>
Approximator<PFP,T,ORBIT>::getAllApprox(Dart d) const
{
	std::vector<T> res ;
	res.resize(m_attrV.size()) ;
	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
		res[i] = m_approx[i][d] ;

	return res ;
}

template <typename PFP, typename T, unsigned int ORBIT>
const Predictor<PFP, T>*
Approximator<PFP,T,ORBIT>::getPredictor() const
{
	return m_predictor ;
}

template <typename PFP, typename T, unsigned int ORBIT>
const T&
Approximator<PFP,T,ORBIT>::getDetail(Dart d, unsigned int index) const
{
	assert(m_predictor || !"Trying to get detail on a non-predictive scheme") ;
	return m_detail[index][d] ;
}

template <typename PFP, typename T, unsigned int ORBIT>
std::vector<T>
Approximator<PFP,T,ORBIT>::getAllDetail(Dart d) const
{
	assert(m_predictor || !"Trying to get detail on a non-predictive scheme") ;

	std::vector<T> res ;
	res.resize(m_attrV.size()) ;
	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
		res[i] = m_detail[i][d] ;
	return res ;
}

template <typename PFP, typename T, unsigned int ORBIT>
void
Approximator<PFP,T,ORBIT>::setDetail(Dart d, unsigned int index, T& val)
{
	assert(m_predictor || !"Trying to set detail on a non-predictive scheme") ;
	m_detail[index][d] = val ;
}

template <typename PFP, typename T, unsigned int ORBIT>
void
Approximator<PFP,T,ORBIT>::setDetail(Dart d, std::vector<T>& val)
{
	assert(m_predictor || !"Trying to set detail on a non-predictive scheme") ;

	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
		m_detail[index][d] = val[i] ;
}


//	// TODO works only for vector types !!
//	REAL detailMagnitude(Dart d)
//	{
//		assert(m_predictor || !"Trying to get detail magnitude on a non-predictive scheme") ;
//		return m_detail[d].norm2() ;
//	}

template <typename PFP, typename T, unsigned int ORBIT>
void
Approximator<PFP,T,ORBIT>::addDetail(Dart d, double amount, bool sign, typename PFP::MATRIX33* detailTransform)
{
	assert(m_predictor || !"Trying to add detail on a non-predictive scheme") ;

	for (unsigned int i = 0 ; i < m_attrV.size() ; ++i)
	{
		T det = m_detail[i][d] ;
		if(detailTransform)
			det = (*detailTransform) * det ;
		det *= amount ;
		if(!sign)
			det *= REAL(-1) ;
		m_attrV[i]->operator[](d) += det ;
	}
}

} //namespace Decimation

} // namespace surface

} //namespace Algo

} //namespace CGoGN