VTK-m
2.0
|
#include <Branch.h>
Public Member Functions | |
void | SimplifyToSize (vtkm::Id targetSize, bool usePersistenceSorter=true) |
void | PrintBranchDecomposition (std::ostream &os, std::string::size_type indent=0) const |
T | Persistence () |
~Branch () | |
void | GetRelevantValues (int type, T eps, std::vector< T > &values) const |
void | AccumulateIntervals (int type, T eps, PiecewiseLinearFunction< T > &plf) const |
Static Public Member Functions | |
template<typename StorageType > | |
static Branch< T > * | ComputeBranchDecomposition (const IdArrayType &contourTreeSuperparents, const IdArrayType &contourTreeSupernodes, const IdArrayType &whichBranch, const IdArrayType &branchMinimum, const IdArrayType &branchMaximum, const IdArrayType &branchSaddle, const IdArrayType &branchParent, const IdArrayType &sortOrder, const vtkm::cont::ArrayHandle< T, StorageType > &dataField, bool dataFieldIsSorted) |
Public Attributes | |
vtkm::Id | OriginalId |
vtkm::Id | Extremum |
T | ExtremumVal |
vtkm::Id | Saddle |
T | SaddleVal |
vtkm::Id | Volume |
Branch< T > * | Parent |
std::vector< Branch< T > * > | Children |
Private Member Functions | |
Branch () | |
void | removeSymbolicPerturbation () |
vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::~Branch |
|
inlineprivate |
void vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::AccumulateIntervals | ( | int | type, |
T | eps, | ||
PiecewiseLinearFunction< T > & | plf | ||
) | const |
|
static |
void vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::GetRelevantValues | ( | int | type, |
T | eps, | ||
std::vector< T > & | values | ||
) | const |
|
inline |
void vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::PrintBranchDecomposition | ( | std::ostream & | os, |
std::string::size_type | indent = 0 |
||
) | const |
|
private |
void vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::SimplifyToSize | ( | vtkm::Id | targetSize, |
bool | usePersistenceSorter = true |
||
) |
std::vector<Branch<T>*> vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::Children |
vtkm::Id vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::Extremum |
T vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::ExtremumVal |
vtkm::Id vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::OriginalId |
Branch<T>* vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::Parent |
vtkm::Id vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::Saddle |
T vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::SaddleVal |
vtkm::Id vtkm::worklet::contourtree_augmented::process_contourtree_inc::Branch< T >::Volume |