VTK
|
abstract class for custom Reeb graph simplification metric design. More...
#include <vtkReebGraphSimplificationMetric.h>
Public Types | |
typedef vtkObject | Superclass |
Public Member Functions | |
virtual int | IsA (const char *type) |
vtkReebGraphSimplificationMetric * | NewInstance () const |
void | PrintSelf (ostream &os, vtkIndent indent) |
virtual void | SetLowerBound (double) |
virtual double | GetLowerBound () |
virtual void | SetUpperBound (double) |
virtual double | GetUpperBound () |
virtual double | ComputeMetric (vtkDataSet *mesh, vtkDataArray *field, vtkIdType startCriticalPoint, vtkAbstractArray *vertexList, vtkIdType endCriticalPoint) |
Static Public Member Functions | |
static vtkReebGraphSimplificationMetric * | New () |
static int | IsTypeOf (const char *type) |
static vtkReebGraphSimplificationMetric * | SafeDownCast (vtkObjectBase *o) |
Protected Member Functions | |
virtual vtkObjectBase * | NewInstanceInternal () const |
vtkReebGraphSimplificationMetric () | |
~vtkReebGraphSimplificationMetric () | |
Protected Attributes | |
double | LowerBound |
double | UpperBound |
abstract class for custom Reeb graph simplification metric design.
This class makes it possible to design customized simplification metric evaluation algorithms, enabling the user to control the definition of what should be considered as noise or signal in the topological filtering process.
References: "Topological persistence and simplification", H. Edelsbrunner, D. Letscher, and A. Zomorodian, Discrete Computational Geometry, 28:511-533, 2002.
"Extreme elevation on a 2-manifold", P.K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang, ACM Symposium on Computational Geometry, pp. 357-365, 2004.
"Simplifying flexible isosurfaces using local geometric measures", H. Carr, J. Snoeyink, M van de Panne, IEEE Visualization, 497-504, 2004
"Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees", J. Tierny, A. Gyulassy, E. Simon, V. Pascucci, IEEE Trans. on Vis. and Comp. Graph. (Proc of IEEE VIS), 15:1177-1184, 2009.
See Graphics/Testing/Cxx/TestReebGraph.cxx for an example of concrete implemetnation.
Definition at line 58 of file vtkReebGraphSimplificationMetric.h.
Reimplemented from vtkObject.
Definition at line 63 of file vtkReebGraphSimplificationMetric.h.
static vtkReebGraphSimplificationMetric* vtkReebGraphSimplificationMetric::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkObject.
static int vtkReebGraphSimplificationMetric::IsTypeOf | ( | const char * | name | ) | [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 vtkObject.
virtual int vtkReebGraphSimplificationMetric::IsA | ( | const char * | name | ) | [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 vtkObject.
static vtkReebGraphSimplificationMetric* vtkReebGraphSimplificationMetric::SafeDownCast | ( | vtkObjectBase * | o | ) | [static] |
Reimplemented from vtkObject.
virtual vtkObjectBase* vtkReebGraphSimplificationMetric::NewInstanceInternal | ( | ) | const [protected, virtual] |
Reimplemented from vtkObject.
Reimplemented from vtkObject.
void vtkReebGraphSimplificationMetric::PrintSelf | ( | ostream & | os, |
vtkIndent | indent | ||
) | [virtual] |
virtual void vtkReebGraphSimplificationMetric::SetLowerBound | ( | double | ) | [virtual] |
Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1.
virtual double vtkReebGraphSimplificationMetric::GetLowerBound | ( | ) | [virtual] |
Set the lowest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1.
virtual void vtkReebGraphSimplificationMetric::SetUpperBound | ( | double | ) | [virtual] |
Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1.
virtual double vtkReebGraphSimplificationMetric::GetUpperBound | ( | ) | [virtual] |
Set the highest possible value for the custom metric space. This value can be set prior to launching the Reeb graph simplification and then used inside the ComputeMetric call to make sure the returned value of ComputeMetric call is indeed between 0 and 1.
virtual double vtkReebGraphSimplificationMetric::ComputeMetric | ( | vtkDataSet * | mesh, |
vtkDataArray * | field, | ||
vtkIdType | startCriticalPoint, | ||
vtkAbstractArray * | vertexList, | ||
vtkIdType | endCriticalPoint | ||
) | [virtual] |
Function to implement in your simplification metric algorithm. Given the input mesh and the Ids of the vertices living on the Reeb graph arc to consider for removal, you should return a value between 0 and 1 (the smallest the more likely the arc will be removed, depending on the user-defined simplification threshold).
double vtkReebGraphSimplificationMetric::LowerBound [protected] |
Definition at line 99 of file vtkReebGraphSimplificationMetric.h.
double vtkReebGraphSimplificationMetric::UpperBound [protected] |
Definition at line 99 of file vtkReebGraphSimplificationMetric.h.