lerpAttributes.h 6.63 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
/*******************************************************************************
* 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 __MR_LERPATTRIB_FILTER__
#define __MR_LERPATTRIB_FILTER__

#include <cmath>
#include "Algo/Multiresolution/filter.h"
#include "Topology/generic/functor.h"

namespace CGoGN
{

namespace Algo
{

38 39 40
namespace Surface
{

41 42 43 44 45 46 47 48
namespace MR
{

/*********************************************************************************
 *                           SYNTHESIS FILTERS
 *********************************************************************************/

template <typename PFP>
49
class vertexFilter : public Algo::MR::Filter
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
{
protected:
	typename PFP::MAP& m_map ;
	VertexAttribute<typename PFP::VEC3>& m_position ;

public:
	vertexFilter(typename PFP::MAP& m, VertexAttribute<typename PFP::VEC3>& p) : m_map(m), m_position(p)
	{}

	void operator() ()
	{
		TraversorV<typename PFP::MAP> tE(m_map);
		for(Dart d = tE.begin() ; d != tE.end() ; d = tE.next())
		{
			Dart dit = d;
			Dart dres = d;
			bool found = false;
			do
			{
				if((m_map.getDartLevel(dit) == (m_map.getCurrentLevel()-1)) && (m_map.getDartLevel(m_map.phi2(dit)) == m_map.getCurrentLevel()))
				{
					dres = dit;
					found = true;
				}

				dit = m_map.phi2(m_map.phi_1(dit));

			}while(!found && dit!=d);

79 80
//			m_map.template setOrbitEmbedding<VERTEX>(dres, m_map.template getEmbedding<VERTEX>(dres));
			Algo::Topo::setOrbitEmbedding<VERTEX>(m_map,template getEmbedding<VERTEX>(dres));
81 82 83 84 85 86 87 88 89 90 91 92 93
		}

//		SelectorEdgeLevel<typename PFP::MAP> ml(m_map, m_map.getCurrentLevel());
//
//		TraversorV<typename PFP::MAP> tV(m_map, ml, true);
//		for(Dart d = tV.begin() ; d != tV.end() ; d = tV.next())
//		{
//			m_map.template embedOrbit<VERTEX>(d, m_map.template getEmbedding<VERTEX>(d));
//		}
	}
};

template <typename PFP>
94
class LerpVertexSynthesisFilter : public Algo::MR::Filter
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
{
protected:
	typename PFP::MAP& m_map ;
	VertexAttribute<typename PFP::VEC3>& m_attrib ;

public:
	LerpVertexSynthesisFilter(typename PFP::MAP& m, VertexAttribute<typename PFP::VEC3>& p) : m_map(m), m_attrib(p)
	{}

	void operator() ()
	{
		if(m_attrib.isValid())
		{
			TraversorV<typename PFP::MAP> tE(m_map);
			for(Dart d = tE.begin() ; d != tE.end() ; d = tE.next())
			{
				Dart dit = d;
				Dart dres = d;
				bool found = false;
				//1ere boucle est-ce qu'il y a un brin de niveau i

				do
				{
					if((m_map.getDartLevel(dit) < m_map.getCurrentLevel()) && (m_map.getDartLevel(m_map.phi2(dit)) == m_map.getCurrentLevel()))
					{
						dres = dit;
						found = true;
					}

					dit = m_map.phi2(m_map.phi_1(dit));

				}while(!found && dit!=d);


				if(found)
				{
					m_map.decCurrentLevel();
					typename PFP::VEC3 c = m_attrib[dres];
					m_map.incCurrentLevel();

					m_attrib[dres] = c;
				}
			}
		}
	}
} ;


template <typename PFP>
144
class LerpVertexAnalysisFilter : public Algo::MR::Filter
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
{
protected:
	typename PFP::MAP& m_map ;
	VertexAttribute<typename PFP::VEC3>& m_attrib ;

public:
	LerpVertexAnalysisFilter(typename PFP::MAP& m, VertexAttribute<typename PFP::VEC3>& p) : m_map(m), m_attrib(p)
	{}

	void operator() ()
	{
		if(m_attrib.isValid())
		{
			TraversorV<typename PFP::MAP> trav(m_map) ;
			for (Dart d = trav.begin(); d != trav.end(); d = trav.next())
			{
				Dart dit = d;
				Dart dres = d;
				bool found = false;

				do
				{

					m_map.incCurrentLevel();
					Dart d2_1 = m_map.phi2(dit);
					m_map.decCurrentLevel();

					if((m_map.getDartLevel(dit) == m_map.getCurrentLevel()) && m_map.phi2(dit) != d2_1)
					{
						dres = dit;
						found = true;
					}

					dit = m_map.phi2(m_map.phi_1(dit));

				}while(!found && dit!=d);

				if(found)
				{
					m_map.incCurrentLevel();

					typename PFP::VEC3 c1 = m_attrib[m_map.phi2(m_map.phi_1(dres))];
					typename PFP::VEC3 c2 = m_attrib[m_map.phi1(m_map.phi2(m_map.phi_1(m_map.phi2(dres))))];
					m_map.decCurrentLevel();

					m_attrib[dres] = c1 + c2;
					m_attrib[dres] /= 2;
				}
			}
		}
	}
} ;

} // namespace MR

200 201
} // namespace Surface

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
} // namespace Algo

} // namespace CGoGN

#endif

//			Dart dit = d;
//			Dart ds = d;
//			bool found = false;
//			//1ere boucle est-ce qu'il y a un brin de niveau i
//			do
//			{
//				if((m_map.getDartLevel(dit) < m_map.getCurrentLevel()) && (m_map.getDartLevel(m_map.phi2(dit)) == m_map.getCurrentLevel()))
//				{
//					ds = dit;
//					found = true;
//				}
//
//				dit = m_map.phi2(m_map.phi_1(dit));
//
//			}while(!found && dit!=d);
//
//
//			if(found)
//			{
//				bool found2 = false;
//				dit = d;
//				Dart dres = dit;
//				//2e boucle chercher un brin de niveau i-1
//				do
//				{
//					if(m_map.getDartLevel(dit) < (m_map.getCurrentLevel()))
//					{
//						if(m_map.getDartLevel(dit) > m_map.getDartLevel(dres))
//							dres = dit;
//
//						//found2 = true;
//					}
//
//					dit = m_map.phi2(m_map.phi_1(dit));
//
//				}while(dit!=d);
//
//				//if(!found2)
//				//	std::cout << "non trouve......." << std::endl;
//
//				//if(dres != d)
//					m_attrib[ds] = m_attrib[dres];
//			}