vtkm::worklet::contourtree::ChainGraph< T, StorageType > Class Template Reference

#include <ChainGraph.h>

Public Member Functions
	ChainGraph (const vtkm::cont::ArrayHandle< T, StorageType > &Values, vtkm::cont::ArrayHandle< vtkm::Id > &ArcArray, bool IsJoinGraph)
void	AllocateVertexArrays (vtkm::Id Size)
void	AllocateEdgeArrays (vtkm::Id Size)
void	Compute (vtkm::cont::ArrayHandle< vtkm::Id > &saddles)
void	FindGoverningSaddles ()
void	TransferRegularPoints ()
void	CompactActiveVertices ()
void	CompactActiveEdges ()
void	BuildChains ()
void	TransferSaddleStarts ()
void	BuildTrunk ()
void	TransferToMergeTree (vtkm::cont::ArrayHandle< vtkm::Id > &saddles)
void	DebugPrint (const char *message)

Public Attributes
const vtkm::cont::ArrayHandle< T, StorageType > &	values
vtkm::cont::ArrayHandle< vtkm::Id > &	arcArray
vtkm::cont::ArrayHandle< vtkm::Id >	valueIndex
bool	isJoinGraph
vtkm::Id	nIterations
vtkm::cont::ArrayHandle< vtkm::Id >	prunesTo
vtkm::cont::ArrayHandle< vtkm::Id >	firstEdge
vtkm::cont::ArrayHandle< vtkm::Id >	outdegree
vtkm::cont::ArrayHandle< vtkm::Id >	chainExtremum
vtkm::cont::ArrayHandle< vtkm::Id >	edgeFar
vtkm::cont::ArrayHandle< vtkm::Id >	edgeNear
vtkm::cont::ArrayHandle< vtkm::Id >	activeVertices
vtkm::cont::ArrayHandle< vtkm::Id >	activeEdges
vtkm::cont::ArrayHandle< vtkm::Id >	edgeSorter

Constructor & Destructor Documentation

ChainGraph()

template<typename T , typename StorageType >

vtkm::worklet::contourtree::ChainGraph< T, StorageType >::ChainGraph ( const vtkm::cont::ArrayHandle< T, StorageType > &  Values, vtkm::cont::ArrayHandle< vtkm::Id > &  ArcArray, bool  IsJoinGraph  )

inline

Member Function Documentation

AllocateEdgeArrays()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::AllocateEdgeArrays

(

vtkm::Id

Size

)

AllocateVertexArrays()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::AllocateVertexArrays

(

vtkm::Id

Size

)

BuildChains()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::BuildChains

BuildTrunk()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::BuildTrunk

CompactActiveEdges()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::CompactActiveEdges

CompactActiveVertices()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::CompactActiveVertices

Compute()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::Compute

(

vtkm::cont::ArrayHandle< vtkm::Id > &

saddles

)

DebugPrint()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::DebugPrint

(

const char *

message

)

FindGoverningSaddles()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::FindGoverningSaddles

TransferRegularPoints()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::TransferRegularPoints

TransferSaddleStarts()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::TransferSaddleStarts

TransferToMergeTree()

template<typename T , typename StorageType >

void vtkm::worklet::contourtree::ChainGraph< T, StorageType >::TransferToMergeTree

(

vtkm::cont::ArrayHandle< vtkm::Id > &

saddles

)

Member Data Documentation

activeEdges

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::activeEdges

activeVertices

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::activeVertices

arcArray

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id>& vtkm::worklet::contourtree::ChainGraph< T, StorageType >::arcArray

chainExtremum

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::chainExtremum

edgeFar

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::edgeFar

edgeNear

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::edgeNear

edgeSorter

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::edgeSorter

firstEdge

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::firstEdge

isJoinGraph

template<typename T , typename StorageType >

bool vtkm::worklet::contourtree::ChainGraph< T, StorageType >::isJoinGraph

nIterations

template<typename T , typename StorageType >

vtkm::Id vtkm::worklet::contourtree::ChainGraph< T, StorageType >::nIterations

outdegree

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::outdegree

prunesTo

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::prunesTo

valueIndex

template<typename T , typename StorageType >

vtkm::cont::ArrayHandle<vtkm::Id> vtkm::worklet::contourtree::ChainGraph< T, StorageType >::valueIndex

values

template<typename T , typename StorageType >

const vtkm::cont::ArrayHandle<T, StorageType>& vtkm::worklet::contourtree::ChainGraph< T, StorageType >::values

---

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

• ChainGraph.h