refine_loop.h File Reference

This file contain code for Loop's subdivision scheme for triangular mesh and some similar method. More...

#include <cmath>
#include <vcg/space/point3.h>
#include <vcg/complex/complex.h>
#include <vcg/complex/algorithms/refine.h>
#include <vcg/space/color4.h>
#include <vcg/container/simple_temporary_data.h>
#include <vcg/complex/algorithms/update/flag.h>
#include <vcg/complex/algorithms/update/color.h>

Include dependency graph for refine_loop.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	vcg::tri::Centroid< MESH_TYPE, LSCALAR_TYPE >
	Allow to compute classical Loop subdivision surface with the same code than LS3. More...
struct	vcg::tri::ContinuityLoopWeight< SCALAR_TYPE >
struct	vcg::tri::EvenPointLoop< MESH_TYPE >
struct	vcg::tri::EvenPointLoopGeneric< MESH_TYPE, METHOD_TYPE, WEIGHT_TYPE >
struct	vcg::tri::LoopWeight< SCALAR_TYPE >
	Weight class for classical Loop's scheme. More...
struct	vcg::tri::LS3Projection< MESH_TYPE, LSCALAR_TYPE >
struct	vcg::tri::OddPointLoop< MESH_TYPE >
struct	vcg::tri::OddPointLoopGeneric< MESH_TYPE, METHOD_TYPE, WEIGHT_TYPE >
struct	vcg::tri::RegularLoopWeight< SCALAR_TYPE >
	Modified Loop's weight to optimise continuity. More...
Namespaces
namespace	vcg
	*
namespace	vcg::tri
Functions
template<class MESH_TYPE , class ODD_VERT , class EVEN_VERT >
bool	vcg::tri::RefineOddEven (MESH_TYPE &m, ODD_VERT odd, EVEN_VERT even, float length, bool RefineSelected=false, CallBackPos *cbOdd=0, CallBackPos *cbEven=0)
template<class MESH_TYPE , class ODD_VERT , class EVEN_VERT , class PREDICATE >
bool	vcg::tri::RefineOddEvenE (MESH_TYPE &m, ODD_VERT odd, EVEN_VERT even, PREDICATE edgePred, bool RefineSelected=false, CallBackPos *cbOdd=0, CallBackPos *cbEven=0)
	Perform diadic subdivision using given rules for odd and even vertices.

---

Detailed Description

This file contain code for Loop's subdivision scheme for triangular mesh and some similar method.

Definition in file refine_loop.h.