57 #ifndef OPENMESH_SUBDIVIDER_UNIFORM_INTERP_SQRT3T_LABSIK_GREINER_HH
58 #define OPENMESH_SUBDIVIDER_UNIFORM_INTERP_SQRT3T_LABSIK_GREINER_HH
63 #include <OpenMesh/Core/Mesh/Handles.hh>
64 #include <OpenMesh/Core/System/config.hh>
67 #if defined(_DEBUG) || defined(DEBUG)
70 # include <OpenMesh/Tools/Utils/MeshCheckerT.hh>
71 # define ASSERT_CONSISTENCY( T, m ) \
72 assert(OpenMesh::Utils::MeshCheckerT<T>(m).check())
74 # define ASSERT_CONSISTENCY( T, m )
78 #if defined(OM_CC_MIPS)
90 namespace Subdivider {
105 template <
typename MeshType,
typename RealType =
float>
110 typedef RealType real_t;
111 typedef MeshType mesh_t;
114 typedef std::vector< std::vector<real_t> > weights_t;
131 const char *
name()
const {
return "Uniform Interpolating Sqrt3"; }
136 weights_.resize(_max_valence);
138 weights_[3].resize(4);
139 weights_[3][0] = real_t(+4.0/27);
140 weights_[3][1] = real_t(-5.0/27);
141 weights_[3][2] = real_t(+4.0/27);
142 weights_[3][3] = real_t(+8.0/9);
144 weights_[4].resize(5);
145 weights_[4][0] = real_t(+2.0/9);
146 weights_[4][1] = real_t(-1.0/9);
147 weights_[4][2] = real_t(-1.0/9);
148 weights_[4][3] = real_t(+2.0/9);
149 weights_[4][4] = real_t(+7.0/9);
151 for(
unsigned int K=5; K<_max_valence; ++K)
153 weights_[K].resize(K+1);
154 real_t aH = 2.0*cos(M_PI/K)/3.0;
155 weights_[K][K] = 1.0 - aH*aH;
156 for(
unsigned int i=0; i<K; ++i)
158 weights_[K][i] = (aH*aH + 2.0*aH*cos(2.0*i*M_PI/K + M_PI/K) + 2.0*aH*aH*cos(4.0*i*M_PI/K + 2.0*M_PI/K))/K;
163 weights_[6].resize(0);
173 _m.request_edge_status();
174 _m.add_property( fp_pos_ );
175 _m.add_property( ep_nv_ );
176 _m.add_property( mp_gen_ );
177 _m.property( mp_gen_ ) = 0;
179 return _m.has_edge_status()
180 && ep_nv_.is_valid() && mp_gen_.
is_valid();
186 _m.release_edge_status();
187 _m.remove_property( fp_pos_ );
188 _m.remove_property( ep_nv_ );
189 _m.remove_property( mp_gen_ );
194 bool subdivide( MeshType& _m,
size_t _n ,
const bool _update_points =
true)
199 typename MeshType::VertexIter vit;
200 typename MeshType::VertexVertexIter vvit;
201 typename MeshType::EdgeIter eit;
202 typename MeshType::FaceIter fit;
203 typename MeshType::FaceVertexIter fvit;
204 typename MeshType::FaceHalfedgeIter fheit;
205 typename MeshType::VertexHandle vh;
206 typename MeshType::HalfedgeHandle heh;
207 typename MeshType::Point pos(0,0,0), zero(0,0,0);
208 size_t &gen = _m.property( mp_gen_ );
210 for (
size_t l=0; l<_n; ++l)
213 for (eit=_m.edges_begin(); eit != _m.edges_end();++eit)
215 _m.status( *eit ).set_tagged(
true );
216 if ( (gen%2) && _m.is_boundary(*eit) )
217 compute_new_boundary_points( _m, *eit );
221 typename MeshType::FaceIter fend = _m.faces_end();
222 for (fit = _m.faces_begin();fit != fend; ++fit)
224 if (_m.is_boundary(*fit))
227 _m.property(fp_pos_, *fit).invalidate();
231 for( heh = _m.halfedge_handle(*fit); !_m.is_boundary( _m.opposite_halfedge_handle(heh) ); heh = _m.next_halfedge_handle(heh) )
233 assert(_m.is_boundary( _m.opposite_halfedge_handle(heh) ));
236 if( _m.is_boundary(_m.next_halfedge_handle(heh)) || _m.is_boundary(_m.prev_halfedge_handle(heh)) )
238 if(_m.is_boundary(_m.prev_halfedge_handle(heh)))
239 heh = _m.prev_halfedge_handle(heh);
241 if(_m.is_boundary(_m.next_halfedge_handle(_m.next_halfedge_handle(heh))))
244 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(heh));
245 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
246 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(_m.prev_halfedge_handle(heh)));
250 #ifdef MIRROR_TRIANGLES
252 pos += real_t(2.0/9) * _m.point(_m.to_vertex_handle(heh));
253 pos += real_t(4.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
254 pos += real_t(4.0/9) * _m.point(_m.to_vertex_handle(_m.prev_halfedge_handle(heh)));
255 pos += real_t(-1.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)))));
257 pos += real_t(7.0/24) * _m.point(_m.to_vertex_handle(heh));
258 pos += real_t(3.0/8) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
259 pos += real_t(3.0/8) * _m.point(_m.to_vertex_handle(_m.prev_halfedge_handle(heh)));
260 pos += real_t(-1.0/24) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)))));
266 vh = _m.to_vertex_handle(_m.next_halfedge_handle(heh));
268 if((_m.valence(vh) == 6) || _m.is_boundary(vh))
270 #ifdef MIRROR_TRIANGLES
272 pos += real_t(5.0/9) * _m.point(vh);
273 pos += real_t(3.0/9) * _m.point(_m.to_vertex_handle(heh));
274 pos += real_t(3.0/9) * _m.point(_m.to_vertex_handle(_m.opposite_halfedge_handle(heh)));
275 pos += real_t(-1.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.next_halfedge_handle(heh)))));
276 pos += real_t(-1.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)))));
279 pos += real_t(1.0/9) * _m.point(vh);
280 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(heh));
281 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(_m.opposite_halfedge_handle(heh)));
282 pos += real_t(1.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.next_halfedge_handle(heh)))));
283 pos += real_t(1.0/9) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)))));
285 pos += real_t(1.0/2) * _m.point(vh);
286 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(heh));
287 pos += real_t(1.0/3) * _m.point(_m.to_vertex_handle(_m.opposite_halfedge_handle(heh)));
288 pos += real_t(-1.0/12) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.next_halfedge_handle(heh)))));
289 pos += real_t(-1.0/12) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(_m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)))));
296 unsigned int K = _m.valence(vh);
297 pos += weights_[K][K]*_m.point(vh);
298 heh = _m.opposite_halfedge_handle( _m.next_halfedge_handle(heh) );
299 for(
unsigned int i = 0; i<K; ++i, heh = _m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)) )
301 pos += weights_[K][i]*_m.point(_m.to_vertex_handle(heh));
305 vh = _m.add_vertex( pos );
306 _m.property(fp_pos_, *fit) = vh;
315 for(fvit = _m.fv_iter( *fit ); fvit.is_valid(); ++fvit)
316 if( (_m.valence(*fvit)) == 6 || _m.is_boundary(*fvit) )
321 for(fheit = _m.fh_iter( *fit ); fheit.is_valid(); ++fheit)
325 assert(_m.to_vertex_handle(heh).is_valid());
326 pos += real_t(32.0/81) * _m.point(_m.to_vertex_handle(heh));
328 heh = _m.opposite_halfedge_handle(heh);
329 assert(heh.is_valid());
330 assert(_m.next_halfedge_handle(heh).is_valid());
331 assert(_m.to_vertex_handle(_m.next_halfedge_handle(heh)).is_valid());
332 pos -= real_t(1.0/81) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
334 heh = _m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh));
335 assert(heh.is_valid());
336 assert(_m.next_halfedge_handle(heh).is_valid());
337 assert(_m.to_vertex_handle(_m.next_halfedge_handle(heh)).is_valid());
338 pos -= real_t(2.0/81) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
339 heh = _m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh));
340 assert(heh.is_valid());
341 assert(_m.next_halfedge_handle(heh).is_valid());
342 assert(_m.to_vertex_handle(_m.next_halfedge_handle(heh)).is_valid());
343 pos -= real_t(2.0/81) * _m.point(_m.to_vertex_handle(_m.next_halfedge_handle(heh)));
349 for(fheit = _m.fh_iter( *fit ); fheit.is_valid(); ++fheit)
351 vh = _m.to_vertex_handle(*fheit);
352 if( (_m.valence(vh) != 6) && (!_m.is_boundary(vh)) )
354 unsigned int K = _m.valence(vh);
355 pos += weights_[K][K]*_m.point(vh);
356 heh = _m.opposite_halfedge_handle( *fheit );
357 for(
unsigned int i = 0; i<K; ++i, heh = _m.opposite_halfedge_handle(_m.prev_halfedge_handle(heh)) )
359 pos += weights_[K][i]*_m.point(_m.to_vertex_handle(heh));
363 pos *= real_t(1.0/(3-nOrdinary));
366 vh = _m.add_vertex( pos );
367 _m.property(fp_pos_, *fit) = vh;
372 for (fit = _m.faces_begin();fit != fend; ++fit)
374 if ( _m.is_boundary(*fit) && (gen%2))
376 boundary_split( _m, *fit );
380 assert(_m.property(fp_pos_, *fit).is_valid());
381 _m.split( *fit, _m.property(fp_pos_, *fit) );
386 for (eit=_m.edges_begin(); eit != _m.edges_end(); ++eit)
387 if ( _m.status( *eit ).tagged() && !_m.is_boundary( *eit ) )
391 ASSERT_CONSISTENCY( MeshType, _m );
403 void compute_new_boundary_points( MeshType& _m,
404 const typename MeshType::EdgeHandle& _eh)
406 assert( _m.is_boundary(_eh) );
408 typename MeshType::HalfedgeHandle heh;
409 typename MeshType::VertexHandle vh1, vh2, vh3, vh4, vhl, vhr;
410 typename MeshType::Point zero(0,0,0), P1, P2, P3, P4;
425 heh = _m.halfedge_handle(_eh,
426 _m.is_boundary(_m.halfedge_handle(_eh,1)));
428 assert( _m.is_boundary( _m.next_halfedge_handle( heh ) ) );
429 assert( _m.is_boundary( _m.prev_halfedge_handle( heh ) ) );
431 vh1 = _m.to_vertex_handle( _m.next_halfedge_handle( heh ) );
432 vh2 = _m.to_vertex_handle( heh );
433 vh3 = _m.from_vertex_handle( heh );
434 vh4 = _m.from_vertex_handle( _m.prev_halfedge_handle( heh ));
441 vhl = _m.add_vertex(real_t(-5.0/81)*P1 + real_t(20.0/27)*P2 + real_t(10.0/27)*P3 + real_t(-4.0/81)*P4);
442 vhr = _m.add_vertex(real_t(-5.0/81)*P4 + real_t(20.0/27)*P3 + real_t(10.0/27)*P2 + real_t(-4.0/81)*P1);
444 _m.property(ep_nv_, _eh).first = vhl;
445 _m.property(ep_nv_, _eh).second = vhr;
449 void boundary_split( MeshType& _m,
const typename MeshType::FaceHandle& _fh )
451 assert( _m.is_boundary(_fh) );
453 typename MeshType::VertexHandle vhl, vhr;
454 typename MeshType::FaceEdgeIter fe_it;
455 typename MeshType::HalfedgeHandle heh;
458 for( fe_it=_m.fe_iter( _fh ); fe_it.is_valid() && !_m.is_boundary( *fe_it ); ++fe_it ) {};
461 vhl = _m.property(ep_nv_, *fe_it).first;
462 vhr = _m.property(ep_nv_, *fe_it).second;
477 heh = _m.halfedge_handle(*fe_it, _m.is_boundary(_m.halfedge_handle(*fe_it,0)));
479 typename MeshType::HalfedgeHandle pl_P3;
482 boundary_split( _m, heh, vhl );
483 pl_P3 = _m.next_halfedge_handle( heh );
484 boundary_split( _m, heh );
487 boundary_split( _m, pl_P3, vhr );
488 boundary_split( _m, pl_P3 );
490 assert( _m.is_boundary( vhl ) && _m.halfedge_handle(vhl).is_valid() );
491 assert( _m.is_boundary( vhr ) && _m.halfedge_handle(vhr).is_valid() );
494 void boundary_split(MeshType& _m,
495 const typename MeshType::HalfedgeHandle& _heh,
496 const typename MeshType::VertexHandle& _vh)
498 assert( _m.is_boundary( _m.edge_handle(_heh) ) );
500 typename MeshType::HalfedgeHandle
502 opp_heh( _m.opposite_halfedge_handle(_heh) ),
503 new_heh, opp_new_heh;
504 typename MeshType::VertexHandle to_vh(_m.to_vertex_handle(heh));
505 typename MeshType::HalfedgeHandle t_heh;
526 _m.next_halfedge_handle(t_heh) != opp_heh;
527 t_heh = _m.opposite_halfedge_handle(_m.next_halfedge_handle(t_heh)))
530 assert( _m.is_boundary( t_heh ) );
532 new_heh = _m.new_edge( _vh, to_vh );
533 opp_new_heh = _m.opposite_halfedge_handle(new_heh);
536 _m.set_next_halfedge_handle(t_heh, opp_new_heh);
537 _m.set_next_halfedge_handle(new_heh, _m.next_halfedge_handle(heh));
538 _m.set_next_halfedge_handle(heh, new_heh);
539 _m.set_next_halfedge_handle(opp_new_heh, opp_heh);
542 _m.set_face_handle(opp_new_heh, _m.face_handle(opp_heh));
545 _m.set_vertex_handle(heh, _vh);
548 _m.set_face_handle(new_heh, _m.face_handle(heh));
552 _m.set_halfedge_handle( to_vh, opp_new_heh );
555 _m.set_halfedge_handle( _vh, opp_heh );
558 void boundary_split( MeshType& _m,
559 const typename MeshType::HalfedgeHandle& _heh)
561 assert( _m.is_boundary( _m.opposite_halfedge_handle( _heh ) ) );
563 typename MeshType::HalfedgeHandle
565 n_heh(_m.next_halfedge_handle(heh));
567 typename MeshType::VertexHandle
568 to_vh(_m.to_vertex_handle(heh));
570 typename MeshType::HalfedgeHandle
571 heh2(_m.new_edge(to_vh,
572 _m.to_vertex_handle(_m.next_halfedge_handle(n_heh)))),
573 heh3(_m.opposite_halfedge_handle(heh2));
575 typename MeshType::FaceHandle
576 new_fh(_m.new_face()),
577 fh(_m.face_handle(heh));
580 _m.set_face_handle(heh, new_fh);
581 _m.set_face_handle(heh2, new_fh);
582 _m.set_next_halfedge_handle(heh2, _m.next_halfedge_handle(_m.next_halfedge_handle(n_heh)));
583 _m.set_next_halfedge_handle(heh, heh2);
584 _m.set_face_handle( _m.next_halfedge_handle(heh2), new_fh);
586 _m.set_next_halfedge_handle(heh3, n_heh);
587 _m.set_next_halfedge_handle(_m.next_halfedge_handle(n_heh), heh3);
588 _m.set_face_handle(heh3, fh);
590 _m.set_halfedge_handle( fh, n_heh);
591 _m.set_halfedge_handle(new_fh, heh);
601 typename MeshType::VertexHandle> > ep_nv_;
611 #endif // OPENMESH_SUBDIVIDER_UNIFORM_SQRT3T_HH
bool is_valid() const
The handle is valid iff the index is not equal to -1.
Definition: Handles.hh:70
bool prepare(MeshType &_m)
Prepare mesh, e.g. add properties.
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:171
bool subdivide(MeshType &_m, size_t _n, const bool _update_points=true)
Subdivide mesh _m _n times.
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:194
Contains all the mesh ingredients like the polygonal mesh, the triangle mesh, different mesh kernels ...
Definition: MeshItems.hh:56
void init_weights(size_t _max_valence=50)
Pre-compute weights.
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:134
Handle representing an edge property.
Definition: Property.hh:504
Handle representing a face property.
Definition: Property.hh:518
Abstract base class for uniform subdivision algorithms.
Definition: SubdividerT.hh:87
Uniform Interpolating Sqrt3 subdivision algorithm
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:106
bool cleanup(MeshType &_m)
Cleanup mesh after usage, e.g. remove added properties.
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:184
const char * name() const
Return name of subdivision algorithm.
Definition: Sqrt3InterpolatingSubdividerLabsikGreinerT.hh:131