Main Page   Class Hierarchy   Alphabetical List   Compound List   Compound Members   Related Pages  

vtkDecimate Class Reference

reduce the number of triangles in a mesh. More...

#include <vtkDecimate.h>

Inheritance diagram for vtkDecimate:

Inheritance graph
[legend]
Collaboration diagram for vtkDecimate:

Collaboration graph
[legend]
List of all members.

Public Methods

virtual const char * GetClassName ()
virtual int IsA (const char *type)
void PrintSelf (ostream &os, vtkIndent indent)
virtual void SetInitialError (float)
virtual float GetInitialError ()
virtual void SetErrorIncrement (float)
virtual float GetErrorIncrement ()
virtual void SetMaximumError (float)
virtual float GetMaximumError ()
virtual void SetTargetReduction (float)
virtual float GetTargetReduction ()
virtual void SetMaximumIterations (int)
virtual int GetMaximumIterations ()
virtual void SetMaximumSubIterations (int)
virtual int GetMaximumSubIterations ()
virtual void SetInitialFeatureAngle (float)
virtual float GetInitialFeatureAngle ()
virtual void SetFeatureAngleIncrement (float)
virtual float GetFeatureAngleIncrement ()
virtual void SetMaximumFeatureAngle (float)
virtual float GetMaximumFeatureAngle ()
virtual void SetGenerateErrorScalars (int)
virtual int GetGenerateErrorScalars ()
virtual void GenerateErrorScalarsOn ()
virtual void GenerateErrorScalarsOff ()
virtual void SetPreserveEdges (int)
virtual int GetPreserveEdges ()
virtual void PreserveEdgesOn ()
virtual void PreserveEdgesOff ()
virtual void SetBoundaryVertexDeletion (int)
virtual int GetBoundaryVertexDeletion ()
virtual void BoundaryVertexDeletionOn ()
virtual void BoundaryVertexDeletionOff ()
virtual void SetAspectRatio (float)
virtual float GetAspectRatio ()
virtual void SetPreserveTopology (int)
virtual int GetPreserveTopology ()
virtual void PreserveTopologyOn ()
virtual void PreserveTopologyOff ()
virtual void SetDegree (int)
virtual int GetDegree ()
virtual void SetMaximumNumberOfSquawks (int)
virtual int GetMaximumNumberOfSquawks ()

Static Public Methods

vtkDecimate * New ()
int IsTypeOf (const char *type)
vtkDecimate * SafeDownCast (vtkObject *o)

Protected Methods

 vtkDecimate ()
 ~vtkDecimate ()
 vtkDecimate (const vtkDecimate &)
void operator= (const vtkDecimate &)
void Execute ()
void CreateOutput (int numPts, int numTris, int numEliminated, vtkPointData *pd, vtkPoints *inPts)
int BuildLoop (int ptId, unsigned short int nTris, int *tris)
void EvaluateLoop (int &vtype, int &numFEdges, vtkLocalVertexPtr fedges[])
int CanSplitLoop (vtkLocalVertexPtr fedges[2], int numVerts, vtkLocalVertexPtr verts[], int &n1, vtkLocalVertexPtr l1[], int &n2, vtkLocalVertexPtr l2[], float &ar)
void SplitLoop (vtkLocalVertexPtr fedges[2], int numVerts, vtkLocalVertexPtr *verts, int &n1, vtkLocalVertexPtr *l1, int &n2, vtkLocalVertexPtr *l2)
void Triangulate (int numVerts, vtkLocalVertexPtr verts[])
int CheckError ()

Protected Attributes

float InitialFeatureAngle
float FeatureAngleIncrement
float MaximumFeatureAngle
int PreserveEdges
int BoundaryVertexDeletion
float InitialError
float ErrorIncrement
float MaximumError
float TargetReduction
int MaximumIterations
int MaximumSubIterations
float AspectRatio
int Degree
int Stats [VTK_NUMBER_STATISTICS]
int GenerateErrorScalars
int MaximumNumberOfSquawks
int PreserveTopology
vtkIdListNeighbors
vtkVertexArray * V
vtkTriArray * T

Detailed Description

reduce the number of triangles in a mesh.

Date:
2000/12/10 20:09:15
Revision:
1.47

vtkDecimate is a filter to reduce the number of triangles in a triangle mesh, while preserving the original topology and a forming good approximation to the original geometry. The input to vtkDecimate is a vtkPolyData object, and only triangles are treated. If you desire to decimate polygonal meshes, first triangulate the polygons with the vtkTriangleFilter object.

The algorithm proceeds as follows. Each vertex in the triangle list is evaluated for local planarity (i.e., the triangles using the vertex are gathered and compared to an "average" plane). If the region is locally planar, that is if the target vertex is within a certain distance of the average plane (i.e., the error), and there are no edges radiating from the vertex that have a dihedral angle greater than a user-specified edge angle (i.e., feature angle), and topology is not altered, then that vertex is deleted. The resulting hole is then patched by re-triangulation. The process continues over the entire vertex list (this constitutes an iteration). Iterations proceed until a target reduction is reached or a maximum iteration count is exceeded.

There are a number of additional parameters you can set to control the decimation algorithm. The Error ivar may be increased over each iteration with the ErrorIncrement. (These two variables have the largest effect.) Edge preservation (i.e., PreserveEdges ivar) may be disabled or enabled. You can turn on/off edge vertex deletion (i.e., BoundaryVertexDeletion ivar). (Edge vertices are vertices that lie along boundaries of meshes.) Sub iterations are iterations that are performed without changing the decimation criterion. The AspectRatio ivar controls the shape of the triangles that are created, and is the ratio of maximum edge length to minimum edge length. The Degree is the number of triangles using a single vertex. Vertices of high degree are considered "complex" and are never deleted.

Warning:
This implementation has been adapted for a global error bound decimation criterion. That is, the error is a global bound on distance to original surface. This is an improvement over the original Siggraph paper ("Decimation of Triangle Meshes", Proc Siggraph `92.)
Warning:
The algorithm has been extended with a special flag to allow topology modification. When the PreserveTopology flag is on, then the algorithm will preserve the topology of the original mesh. If off, the algorithm may close holes and/or collapse tunnels (i.e., form non-manifold attachments).
See also:
vtkDecimatePro vtkQuadricClustering vtkQuadricDecimation
Examples:
vtkDecimate (examples)


Member Function Documentation

virtual const char* vtkDecimate::GetClassName   [virtual]
 

Return the class name as a string. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataToPolyDataFilter.

virtual int vtkDecimate::IsA const char *    type [virtual]
 

Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataToPolyDataFilter.

int vtkDecimate::IsTypeOf const char *    type [static]
 

Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataToPolyDataFilter.

vtkDecimate* vtkDecimate::New   [static]
 

Instantiate object with no start, end, or progress methods.

Reimplemented from vtkPolyDataSource.

void vtkDecimate::PrintSelf ostream &    os,
vtkIndent    indent
[virtual]
 

Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.

Reimplemented from vtkSource.

vtkDecimate* vtkDecimate::SafeDownCast vtkObject   o [static]
 

Will cast the supplied object to vtkObject* is this is a safe operation (i.e., a safe downcast); otherwise NULL is returned. This method is defined in all subclasses of vtkObject with the vtkTypeMacro found in vtkSetGet.h.

Reimplemented from vtkPolyDataToPolyDataFilter.

virtual void vtkDecimate::SetAspectRatio float    [virtual]
 

Specify the maximum allowable aspect ratio during triangulation.

virtual void vtkDecimate::SetBoundaryVertexDeletion int    [virtual]
 

Turn on/off the deletion of vertices on the boundary of a mesh.

virtual void vtkDecimate::SetDegree int    [virtual]
 

If the number of triangles connected to a vertex exceeds "Degree", then the vertex is considered complex and is never deleted. (NOTE: the complexity of the triangulation algorithm is proportional to Degree^2.)

virtual void vtkDecimate::SetErrorIncrement float    [virtual]
 

Set the value of the increment by which to increase the decimation error after each iteration.

virtual void vtkDecimate::SetFeatureAngleIncrement float    [virtual]
 

Set/Get the angle by which to increase feature angle over each iteration.

virtual void vtkDecimate::SetGenerateErrorScalars int    [virtual]
 

Turn on/off the generation of error scalars.

virtual void vtkDecimate::SetInitialError float    [virtual]
 

Set the decimation error bounds. Expressed as a fraction of the longest side of the input data's bounding box.

virtual void vtkDecimate::SetInitialFeatureAngle float    [virtual]
 

Specify the mesh feature angles.

virtual void vtkDecimate::SetMaximumError float    [virtual]
 

Set the largest decimation error that can be achieved by incrementing the error.

virtual void vtkDecimate::SetMaximumFeatureAngle float    [virtual]
 

Set the largest permissible feature angle.

virtual void vtkDecimate::SetMaximumIterations int    [virtual]
 

Specify the maximum number of iterations to attempt. If decimation target is reached first, this value will not be reached.

virtual void vtkDecimate::SetMaximumNumberOfSquawks int    [virtual]
 

Control the printout of warnings. This flag limits the number of warnings regarding non-manifold geometry and complex vertices. If set to zero, no warnings will appear.

virtual void vtkDecimate::SetMaximumSubIterations int    [virtual]
 

Specify the maximum sub-iterations to perform. If no triangles are deleted in a sub-iteration, the sub-iteration process is stopped.

virtual void vtkDecimate::SetPreserveEdges int    [virtual]
 

Turn on/off the preservation of feature edges.

virtual void vtkDecimate::SetPreserveTopology int    [virtual]
 

Turn on/off whether to preserve the topology of the original mesh. If off, hole elimination and non-manifold attachment can occur.

virtual void vtkDecimate::SetTargetReduction float    [virtual]
 

Specify the desired reduction in the total number of polygons. Because of various constraints, this level of reduction may not be realizable.


The documentation for this class was generated from the following file:
Generated on Tue Mar 19 13:24:52 2002 for VTK by doxygen1.2.14 written by Dimitri van Heesch, © 1997-2002