catmullClark.h 4.01 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
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
/*******************************************************************************
* 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_CC_MASK__
#define __MR_CC_MASK__

#include <cmath>

namespace CGoGN
{

namespace Algo
{

namespace MR
{

namespace Dual
{

namespace Filters
{

template <typename PFP>
class CCVertexSynthesisFilter : public Filter
{
protected:
	typename PFP::MAP& m_map ;
	VertexAttribute<typename PFP::VEC3>& m_position ;

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

	void operator() ()
	{
		TraversorV<typename PFP::MAP> trav(m_map) ;
		for (Dart dV = trav.begin(); dV != trav.end(); dV = trav.next())
		{
			m_map.incCurrentLevel() ;

			Dart start = m_map.phi2(m_map.phi1(m_map.phi2(dV)));
			Dart dit = start;
			do
			{
				Dart d = m_map.phi1(m_map.phi2(m_map.phi1(m_map.phi2(dit))));
				unsigned int degree = m_map.faceDegree(d);
				typename PFP::VEC3 p(0.0);

				typename PFP::REAL a0 = 1.0 / 2.0 + 1.0 / (4.0 * typename PFP::REAL(degree));
				typename PFP::REAL a1 = 1.0 / 8.0 + 1.0 / (4.0 * typename PFP::REAL(degree));
				typename PFP::REAL ak_1 = a1;

				if(degree == 3)
				{
					p += a0 * m_position[d] + a1 * m_position[m_map.phi1(d)] + ak_1 * m_position[m_map.phi_1(d)];

					m_map.incCurrentLevel();
					m_position[d] = p;
					m_map.decCurrentLevel();

				}
				else if(degree == 4)
				{
					typename PFP::REAL a2 = 1.0 / (4.0 * typename PFP::REAL(degree));

					p += a0 * m_position[d] + a1 * m_position[m_map.phi1(d)] + a2 * m_position[m_map.phi1(m_map.phi1(d))] + ak_1 * m_position[m_map.phi_1(d)];

					m_map.incCurrentLevel();
					m_position[d] = p;

				}
				else
				{
					p += a0 * m_position[d] + a1 * m_position[m_map.phi1(d)];

					Dart end = m_map.phi_1(m_map.phi_1(d));
					Dart dit = m_map.phi1(m_map.phi1(d));
					do
					{
						typename PFP::REAL ai = 1.0 / (4.0 * typename PFP::REAL(degree));
						p += ai * m_position[dit];

						dit = m_map.phi1(dit);
					}
					while(dit != end);

					p += ak_1 * m_position[m_map.phi_1(d)];

					m_map.incCurrentLevel();
					m_position[d] = p;
				}


				dit = m_map.phi1(dit);
			}
			while(dit != start);
		}

		m_map.decCurrentLevel();
	}
} ;


} // namespace Masks

} // namespace Primal

} // namespace MR

} // namespace Algo

} // namespace CGoGN

#endif