#include <Branch.h>
|
| 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) |
| |
◆ ~Branch()
◆ Branch()
◆ AccumulateIntervals()
◆ ComputeBranchDecomposition()
template<typename T >
template<typename StorageType >
| Branch< T > * vtkm::worklet::contourtree_augmented::process_contourtree_inc::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 |
|
) |
| |
|
static |
◆ GetRelevantValues()
◆ Persistence()
◆ PrintBranchDecomposition()
◆ removeSymbolicPerturbation()
◆ SimplifyToSize()
◆ Children
◆ Extremum
◆ ExtremumVal
◆ OriginalId
◆ Parent
◆ Saddle
◆ SaddleVal
◆ Volume
The documentation for this class was generated from the following file: