vcg::tri::Clean< CleanMeshType > Class Template Reference

Class of static functions to clean//restore meshs. More...

#include <clean.h>

List of all members.

Classes
struct	CompareAreaFP
class	RemoveDuplicateVert_Compare
class	SortedPair
class	SortedTriple
Public Types
typedef vcg::Box3< ScalarType >	Box3Type
typedef MeshType::ConstFaceIterator	ConstFaceIterator
typedef MeshType::ConstVertexIterator	ConstVertexIterator
typedef MeshType::CoordType	CoordType
typedef MeshType::EdgeIterator	EdgeIterator
typedef MeshType::EdgePointer	EdgePointer
typedef MeshType::FaceContainer	FaceContainer
typedef MeshType::FaceIterator	FaceIterator
typedef MeshType::FacePointer	FacePointer
typedef MeshType::FaceType	FaceType
typedef CleanMeshType	MeshType
typedef MeshType::ScalarType	ScalarType
typedef GridStaticPtr < FaceType, ScalarType >	TriMeshGrid
typedef MeshType::VertexIterator	VertexIterator
typedef MeshType::VertexPointer	VertexPointer
typedef MeshType::VertexType	VertexType
Static Public Member Functions
static int	ClusterVertex (MeshType &m, const ScalarType radius)
static void	ComputeValence (MeshType &m, typename MeshType::PerVertexIntHandle &h)
static int	ConnectedComponents (MeshType &m, std::vector< std::pair< int, FacePointer > > &CCV)
static int	CountBitLargePolygons (MeshType &m)
static int	CountBitPolygons (const MeshType &m)
static int	CountBitQuads (const MeshType &m)
static int	CountBitTris (const MeshType &m)
static int	CountConnectedComponents (MeshType &m)
static void	CountEdgeNum (MeshType &m, int &total_e, int &boundary_e, int &non_manif_e)
static int	CountHoles (MeshType &m)
static int	CountNonManifoldEdgeEE (MeshType &m, bool SelectFlag=false)
static int	CountNonManifoldEdgeFF (MeshType &m, bool SelectFlag=false)
static int	CountNonManifoldVertexFF (MeshType &m, bool selectVert=true)
static int	CountUnreferencedVertex (MeshType &m)
static void	FlipMesh (MeshType &m, bool selected=false)
	Flip the orientation of the whole mesh flipping all the faces (by swapping the first two vertices)
static bool	FlipNormalOutside (MeshType &m)
static bool	HasConsistentPerFaceFauxFlag (const MeshType &m)
static bool	HasConsistentPerWedgeTexCoord (MeshType &m)
static bool	HasZeroTexCoordFace (MeshType &m)
static bool	IsBitPolygonal (const MeshType &m)
static bool	IsBitQuadOnly (const MeshType &m)
static bool	IsBitTriOnly (const MeshType &m)
static bool	IsBitTriQuadOnly (const MeshType &m)
static bool	IsCoherentlyOrientedMesh (MeshType &m)
static bool	IsFaceFauxConsistent (MeshType &m)
static bool	IsFFAdjacencyConsistent (MeshType &m)
static void	IsRegularMesh (MeshType &m, bool &Regular, bool &Semiregular)
static bool	IsSizeConsistent (MeshType &m)
static bool	IsWaterTight (MeshType &m)
static int	MergeCloseVertex (MeshType &m, const ScalarType radius)
static int	MeshGenus (int nvert, int nedges, int nfaces, int numholes, int numcomponents)
static int	MeshGenus (MeshType &m)
static void	OrientCoherentlyMesh (MeshType &m, bool &Oriented, bool &Orientable)
static int	RemoveDegenerateEdge (MeshType &m)
static int	RemoveDegenerateFace (MeshType &m)
static int	RemoveDegenerateVertex (MeshType &m)
static int	RemoveDuplicateEdge (MeshType &m)
static int	RemoveDuplicateFace (MeshType &m)
static int	RemoveDuplicateVertex (MeshType &m, bool RemoveDegenerateFlag=true)
static int	RemoveFaceFoldByFlip (MeshType &m, float normalThresholdDeg=175, bool repeat=true)
static int	RemoveFaceOutOfRangeArea (MeshType &m, ScalarType MinAreaThr=0, ScalarType MaxAreaThr=(std::numeric_limits< ScalarType >::max)())
template<bool Selected>
static int	RemoveFaceOutOfRangeAreaSel (MeshType &m, ScalarType MinAreaThr=0, ScalarType MaxAreaThr=(std::numeric_limits< ScalarType >::max)())
static std::pair< int, int >	RemoveHugeConnectedComponentsDiameter (MeshType &m, ScalarType minDiameter)
	Remove the connected components greater than a given diameter.
static int	RemoveNonManifoldFace (MeshType &m)
	Removal of faces that were incident on a non manifold edge.
static int	RemoveNonManifoldVertex (MeshType &m)
static std::pair< int, int >	RemoveSmallConnectedComponentsDiameter (MeshType &m, ScalarType maxDiameter)
	Remove the connected components smaller than a given diameter.
static std::pair< int, int >	RemoveSmallConnectedComponentsSize (MeshType &m, int maxCCSize)
static int	RemoveTVertexByCollapse (MeshType &m, float threshold=40, bool repeat=true)
static int	RemoveTVertexByFlip (MeshType &m, float threshold=40, bool repeat=true)
static int	RemoveUnreferencedVertex (MeshType &m, bool DeleteVertexFlag=true)
static int	RemoveZeroAreaFace (MeshType &m)
static void	SelectCreaseVertexOnEdgeMesh (MeshType &m, ScalarType AngleRadThr)
static void	SelectFoldedFaceFromOneRingFaces (MeshType &m, ScalarType cosThreshold)
static void	SelectNonManifoldVertexOnEdgeMesh (MeshType &m)
static bool	SelfIntersections (MeshType &m, std::vector< FaceType * > &ret)
static int	SplitNonManifoldVertex (MeshType &m, ScalarType moveThreshold)
	Removal of faces that were incident on a non manifold edge.
static int	SplitSelectedVertexOnEdgeMesh (MeshType &m)
static bool	TestFaceFaceIntersection (FaceType *f0, FaceType *f1)

---

Detailed Description

template<class CleanMeshType>
class vcg::tri::Clean< CleanMeshType >

Class of static functions to clean//restore meshs.

Definition at line 107 of file clean.h.

---

Member Typedef Documentation

template<class CleanMeshType>

typedef vcg::Box3<ScalarType> vcg::tri::Clean< CleanMeshType >::Box3Type

Definition at line 125 of file clean.h.

template<class CleanMeshType>

typedef MeshType::ConstFaceIterator vcg::tri::Clean< CleanMeshType >::ConstFaceIterator

Definition at line 123 of file clean.h.

template<class CleanMeshType>

typedef MeshType::ConstVertexIterator vcg::tri::Clean< CleanMeshType >::ConstVertexIterator

Definition at line 115 of file clean.h.

template<class CleanMeshType>

typedef MeshType::CoordType vcg::tri::Clean< CleanMeshType >::CoordType

Definition at line 118 of file clean.h.

template<class CleanMeshType>

typedef MeshType::EdgeIterator vcg::tri::Clean< CleanMeshType >::EdgeIterator

Definition at line 116 of file clean.h.

template<class CleanMeshType>

typedef MeshType::EdgePointer vcg::tri::Clean< CleanMeshType >::EdgePointer

Definition at line 117 of file clean.h.

template<class CleanMeshType>

typedef MeshType::FaceContainer vcg::tri::Clean< CleanMeshType >::FaceContainer

Definition at line 124 of file clean.h.

template<class CleanMeshType>

typedef MeshType::FaceIterator vcg::tri::Clean< CleanMeshType >::FaceIterator

Definition at line 122 of file clean.h.

template<class CleanMeshType>

typedef MeshType::FacePointer vcg::tri::Clean< CleanMeshType >::FacePointer

Definition at line 121 of file clean.h.

template<class CleanMeshType>

typedef MeshType::FaceType vcg::tri::Clean< CleanMeshType >::FaceType

Definition at line 120 of file clean.h.

template<class CleanMeshType>

typedef CleanMeshType vcg::tri::Clean< CleanMeshType >::MeshType

Definition at line 111 of file clean.h.

template<class CleanMeshType>

typedef MeshType::ScalarType vcg::tri::Clean< CleanMeshType >::ScalarType

Definition at line 119 of file clean.h.

template<class CleanMeshType>

typedef GridStaticPtr<FaceType, ScalarType > vcg::tri::Clean< CleanMeshType >::TriMeshGrid

Definition at line 127 of file clean.h.

template<class CleanMeshType>

typedef MeshType::VertexIterator vcg::tri::Clean< CleanMeshType >::VertexIterator

Definition at line 114 of file clean.h.

template<class CleanMeshType>

typedef MeshType::VertexPointer vcg::tri::Clean< CleanMeshType >::VertexPointer

Definition at line 113 of file clean.h.

template<class CleanMeshType>

typedef MeshType::VertexType vcg::tri::Clean< CleanMeshType >::VertexType

Definition at line 112 of file clean.h.

---

Member Function Documentation

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::ClusterVertex	(	MeshType &	m,
		const ScalarType	radius
	)		[inline, static]

Definition at line 1723 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::ComputeValence	(	MeshType &	m,
		typename MeshType::PerVertexIntHandle &	h
	)		[inline, static]

Definition at line 1138 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::ConnectedComponents	(	MeshType &	m,
		std::vector< std::pair< int, FacePointer > > &	CCV
	)		[inline, static]

Definition at line 1101 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountBitLargePolygons

(

MeshType &

m

)

[inline, static]

The number of polygonal faces is FN - EN_f (each faux edge hides exactly one triangular face or in other words a polygon of n edges has n-3 faux edges.) In the general case where a The number of polygonal faces is FN - EN_f + VN_f where: EN_f is the number of faux edges. VN_f is the number of faux vertices (e.g vertices completely surrounded by faux edges) as a intuitive proof think to a internal vertex that is collapsed onto a border of a polygon: it deletes 2 faces, 1 faux edges and 1 vertex so to keep the balance you have to add back the removed vertex.

Definition at line 788 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountBitPolygons

(

const MeshType &

m

)

[inline, static]

How many polygons of any kind? (including triangles) it assumes that there are no faux vertexes (e.g vertices completely surrounded by faux edges)

Definition at line 765 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountBitQuads

(

const MeshType &

m

)

[inline, static]

How many quadrilaterals? It assumes that the bits are consistent. In that case we count the tris with a single faux edge and divide by two.

Definition at line 736 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountBitTris

(

const MeshType &

m

)

[inline, static]

How many triangles? (non polygonal faces)

Definition at line 751 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountConnectedComponents

(

MeshType &

m

)

[inline, static]

Definition at line 1095 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::CountEdgeNum	(	MeshType &	m,
		int &	total_e,
		int &	boundary_e,
		int &	non_manif_e
	)		[inline, static]

Definition at line 1002 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountHoles

(

MeshType &

m

)

[inline, static]

Definition at line 1032 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountNonManifoldEdgeEE	(	MeshType &	m,
		bool	SelectFlag = false
	)		[inline, static]

Count the number of non manifold edges in a polylinemesh, e.g. the edges where there are more than 2 incident faces.

Definition at line 851 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountNonManifoldEdgeFF	(	MeshType &	m,
		bool	SelectFlag = false
	)		[inline, static]

Count the number of non manifold edges in a mesh, e.g. the edges where there are more than 2 incident faces.

Note that this test is not enough to say that a mesh is two manifold, you have to count also the non manifold vertexes.

Definition at line 889 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountNonManifoldVertexFF	(	MeshType &	m,
		bool	selectVert = true
	)		[inline, static]

Count (and eventually select) non 2-Manifold vertexes of a mesh e.g. the vertices with a non 2-manif. neighbourhood but that do not belong to not 2-manif edges. typical situation two cones connected by one vertex.

Definition at line 941 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::CountUnreferencedVertex

(

MeshType &

m

)

[inline, static]

Definition at line 319 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::FlipMesh	(	MeshType &	m,
		bool	selected = false
	)		[inline, static]

Flip the orientation of the whole mesh flipping all the faces (by swapping the first two vertices)

Definition at line 1352 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::FlipNormalOutside

(

MeshType &

m

)

[inline, static]

Flip a mesh so that its normals are orented outside. Just for safety it uses a voting scheme. It assumes that mesh has already has coherent normals. mesh is watertight and signle component.

Definition at line 1367 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::HasConsistentPerFaceFauxFlag

(

const MeshType &

m

)

[inline, static]

Checks that the mesh has consistent per-face faux edges (the ones that merges triangles into larger polygons). A border edge should never be faux, and faux edges should always be reciprocated by another faux edges. It requires FF adjacency.

Definition at line 831 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::HasConsistentPerWedgeTexCoord

(

MeshType &

m

)

[inline, static]

This function simply test that a mesh has some reasonable tex coord.

Definition at line 1641 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::HasZeroTexCoordFace

(

MeshType &

m

)

[inline, static]

Simple check that there are no face with all collapsed tex coords.

Definition at line 1659 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsBitPolygonal

(

const MeshType &

m

)

[inline, static]

Definition at line 713 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsBitQuadOnly

(

const MeshType &

m

)

[inline, static]

Is the mesh only composed by quadrilaterals?

Definition at line 673 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsBitTriOnly

(

const MeshType &

m

)

[inline, static]

Is the mesh only composed by triangles? (non polygonal faces)

Definition at line 704 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsBitTriQuadOnly

(

const MeshType &

m

)

[inline, static]

Is the mesh only composed by quadrilaterals and triangles? (no pentas, etc) It assumes that the bits are consistent. In that case there can be only a single faux edge.

Definition at line 721 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsCoherentlyOrientedMesh

(

MeshType &

m

)

[inline, static]

Definition at line 1261 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsFaceFauxConsistent

(

MeshType &

m

)

[inline, static]

Definition at line 685 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsFFAdjacencyConsistent

(

MeshType &

m

)

[inline, static]

This function simply test that all the faces have a consistent face-face topology relation. useful for checking that a topology modifying algorithm does not mess something.

Definition at line 1625 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::IsRegularMesh	(	MeshType &	m,
		bool &	Regular,
		bool &	Semiregular
	)		[inline, static]

Check if the given mesh is regular, semi-regular or irregular.

Each vertex of a regular mesh has valence 6 except for border vertices which have valence 4.

A semi-regular mesh is derived from an irregular one applying 1-to-4 subdivision recursively. (not checked for now)

All other meshes are irregular.

Definition at line 1214 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsSizeConsistent

(

MeshType &

m

)

[inline, static]

This function simply test that the vn and fn counters be consistent with the size of the containers and the number of deleted simplexes.

Definition at line 1600 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::IsWaterTight

(

MeshType &

m

)

[inline, static]

Very simple test of water tightness. No boundary and no non manifold edges. Assume that it is orientable. It could be debated if a closed non orientable surface is watertight or not.

The rationale of not testing orientability here is that it requires FFAdj while this test do not require any adjacency.

Definition at line 995 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::MergeCloseVertex	(	MeshType &	m,
		const ScalarType	radius
	)		[inline, static]

This function merge all the vertices that are closer than the given radius

Definition at line 1715 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::MeshGenus	(	int	nvert,
		int	nedges,
		int	nfaces,
		int	numholes,
		int	numcomponents
	)		[inline, static]

GENUS.

A topologically invariant property of a surface defined as the largest number of non-intersecting simple closed curves that can be drawn on the surface without separating it.

Roughly speaking, it is the number of holes in a surface. The genus g of a closed surface, also called the geometric genus, is related to the Euler characteristic by the relation $chi$ by $chi==2-2g$.

The genus of a connected, orientable surface is an integer representing the maximum number of cuttings along closed simple curves without rendering the resultant manifold disconnected. It is equal to the number of handles on it.

For general polyhedra the Euler Formula is:

V - E + F = 2 - 2G - B

where V is the number of vertices, F is the number of faces, E is the number of edges, G is the genus and B is the number of boundary polygons.

The above formula is valid for a mesh with one single connected component. By considering multiple connected components the formula becomes:

V - E + F = 2C - 2Gs - B -> 2Gs = - ( V-E+F +B -2C)

where C is the number of connected components and Gs is the sum of the genus of all connected components.

Note that in the case of a mesh with boundaries the intuitive meaning of Genus is less intuitive that it could seem. A closed sphere, a sphere with one hole (e.g. a disk) and a sphere with two holes (e.g. a tube) all of them have Genus == 0

Definition at line 1186 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::MeshGenus

(

MeshType &

m

)

[inline, static]

Definition at line 1191 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::OrientCoherentlyMesh	(	MeshType &	m,
		bool &	Oriented,
		bool &	Orientable
	)		[inline, static]

Definition at line 1272 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDegenerateEdge

(

MeshType &

m

)

[inline, static]

Definition at line 422 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDegenerateFace

(

MeshType &

m

)

[inline, static]

Degenerate faces are faces that are Topologically degenerate, i.e. have two or more vertex reference that link the same vertex (and not only two vertexes with the same coordinates). All Degenerate faces are zero area faces BUT not all zero area faces are degenerate. We do not take care of topology because when we have degenerate faces the topology calculation functions crash.

Definition at line 404 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDegenerateVertex

(

MeshType &

m

)

[inline, static]

Degenerate vertices are vertices that have coords with invalid floating point values, All the faces incident on deleted vertices are also deleted

Definition at line 367 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDuplicateEdge

(

MeshType &

m

)

[inline, static]

This function removes all duplicate faces of the mesh by looking only at their vertex reference. So it should be called after unification of vertices. Note that it does not update any topology relation that could be affected by this like the VT or TT relation. the reason this function is usually performed BEFORE building any topology information.

Definition at line 294 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDuplicateFace

(

MeshType &

m

)

[inline, static]

This function removes all duplicate faces of the mesh by looking only at their vertex reference. So it should be called after unification of vertices. Note that it does not update any topology relation that could be affected by this like the VT or TT relation. the reason this function is usually performed BEFORE building any topology information.

Definition at line 264 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveDuplicateVertex	(	MeshType &	m,
		bool	RemoveDegenerateFlag = true
	)		[inline, static]

This function removes all duplicate vertices of the mesh by looking only at their spatial positions. Note that it does not update any topology relation that could be affected by this like the VT or TT relation. the reason this function is usually performed BEFORE building any topology information.

Definition at line 143 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveFaceFoldByFlip	(	MeshType &	m,
		float	normalThresholdDeg = 175,
		bool	repeat = true
	)		[inline, static]

Definition at line 1419 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveFaceOutOfRangeArea	(	MeshType &	m,
		ScalarType	MinAreaThr = 0,
		ScalarType	MaxAreaThr = (std::numeric_limits<ScalarType>::max)()
	)		[inline, static]

Definition at line 665 of file clean.h.

template<class CleanMeshType>

template<bool Selected>

static int vcg::tri::Clean< CleanMeshType >::RemoveFaceOutOfRangeAreaSel	(	MeshType &	m,
		ScalarType	MinAreaThr = 0,
		ScalarType	MaxAreaThr = (std::numeric_limits<ScalarType>::max)()
	)		[inline, static]

Definition at line 641 of file clean.h.

template<class CleanMeshType>

static std::pair<int,int> vcg::tri::Clean< CleanMeshType >::RemoveHugeConnectedComponentsDiameter	(	MeshType &	m,
		ScalarType	minDiameter
	)		[inline, static]

Remove the connected components greater than a given diameter.

Definition at line 1816 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveNonManifoldFace

(

MeshType &

m

)

[inline, static]

Removal of faces that were incident on a non manifold edge.

Definition at line 596 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveNonManifoldVertex

(

MeshType &

m

)

[inline, static]

Definition at line 438 of file clean.h.

template<class CleanMeshType>

static std::pair<int,int> vcg::tri::Clean< CleanMeshType >::RemoveSmallConnectedComponentsDiameter	(	MeshType &	m,
		ScalarType	maxDiameter
	)		[inline, static]

Remove the connected components smaller than a given diameter.

Definition at line 1786 of file clean.h.

template<class CleanMeshType>

static std::pair<int,int> vcg::tri::Clean< CleanMeshType >::RemoveSmallConnectedComponentsSize	(	MeshType &	m,
		int	maxCCSize
	)		[inline, static]

Definition at line 1759 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveTVertexByCollapse	(	MeshType &	m,
		float	threshold = 40,
		bool	repeat = true
	)		[inline, static]

Definition at line 1517 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveTVertexByFlip	(	MeshType &	m,
		float	threshold = 40,
		bool	repeat = true
	)		[inline, static]

Definition at line 1469 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveUnreferencedVertex	(	MeshType &	m,
		bool	DeleteVertexFlag = true
	)		[inline, static]

This function removes that are not referenced by any face. The function updates the vn counter.

Parameters:

m

The mesh

Returns:

The number of removed vertices

Definition at line 329 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::RemoveZeroAreaFace

(

MeshType &

m

)

[inline, static]

Definition at line 662 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::SelectCreaseVertexOnEdgeMesh	(	MeshType &	m,
		ScalarType	AngleRadThr
	)		[inline, static]

Definition at line 500 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::SelectFoldedFaceFromOneRingFaces	(	MeshType &	m,
		ScalarType	cosThreshold
	)		[inline, static]

Select the folded faces using an angle threshold on the face normal. The face is selected if the dot product between the face normal and the normal of the plane fitted using the vertices of the one ring faces is below the cosThreshold. The cosThreshold requires a negative cosine value (a positive value is clamp to zero).

Definition at line 1852 of file clean.h.

template<class CleanMeshType>

static void vcg::tri::Clean< CleanMeshType >::SelectNonManifoldVertexOnEdgeMesh

(

MeshType &

m

)

[inline, static]

Definition at line 485 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::SelfIntersections	(	MeshType &	m,
		std::vector< FaceType * > &	ret
	)		[inline, static]

Definition at line 1560 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::SplitNonManifoldVertex	(	MeshType &	m,
		ScalarType	moveThreshold
	)		[inline, static]

Removal of faces that were incident on a non manifold edge.

Definition at line 527 of file clean.h.

template<class CleanMeshType>

static int vcg::tri::Clean< CleanMeshType >::SplitSelectedVertexOnEdgeMesh

(

MeshType &

m

)

[inline, static]

Definition at line 456 of file clean.h.

template<class CleanMeshType>

static bool vcg::tri::Clean< CleanMeshType >::TestFaceFaceIntersection	(	FaceType *	f0,
		FaceType *	f1
	)		[inline, static]

This function test if two triangular faces of a mesh intersect. It assumes that the faces (as storage) are different (e.g different address) If the two faces are different but coincident (same set of vertexes) return true. if the faces share an edge no test is done. if the faces share only a vertex, the opposite edge is tested against the face

Definition at line 1679 of file clean.h.

---

The documentation for this class was generated from the following file:

• clean.h