Class implements a hierarchical tree and provides helper functions for selection and navigation. More...

Inheritance diagram for WHierarchicalTreeVoxels:

Public Member Functions
	WHierarchicalTreeVoxels ()
	standard constructor
	~WHierarchicalTreeVoxels ()
	destructor
std::vector< size_t >	getVoxelsForCluster (size_t cluster)
	getter
void	addLeaf (size_t voxelnum)
	A leaf is at the very bottom of the tree, it represents a single fiber or voxel, for several purposes a leaf also counts as a cluster.
void	addCluster (size_t cluster1, size_t cluster2, float customData)
	adds a cluster to the set, it combines 2 already existing clusters
size_t	getVoxelNum (size_t leaf)
	getter
std::vector< size_t >	findClustersForValue (float value)
	finds the clusters for a given similarity value
std::vector< size_t >	findClustersForBranchLength (float value, size_t minSize=100)
	finds the clusters for a given similarity value
std::vector< size_t >	findXClusters (size_t root, size_t number)
	finds a number of clusters, the algorithm travers down the tree and will always split the cluster with the highest energy level.
Private Member Functions
void	addLeaf ()
	A leaf is at the very bottom of the tree, it represents a single fiber or voxel, for several purposes a leaf also counts as a cluster.
Private Attributes
std::vector< size_t >	m_voxelnums
	stores the voxel id of each leaf node

Detailed Description

Class implements a hierarchical tree and provides helper functions for selection and navigation.

Definition at line 43 of file WHierarchicalTreeVoxels.h.

Constructor & Destructor Documentation

WHierarchicalTreeVoxels::WHierarchicalTreeVoxels ( )

standard constructor

WHierarchicalTreeVoxels::~WHierarchicalTreeVoxels ( )

destructor

void WHierarchicalTreeVoxels::addCluster	(	size_t	cluster1,
		size_t	cluster2,
		float	customData
	)

adds a cluster to the set, it combines 2 already existing clusters

Parameters:

cluster1	first cluster to add
cluster2	second cluster to add
customData	some arbitrary data stored with the cluster

void WHierarchicalTreeVoxels::addLeaf ( ) [private, virtual]

A leaf is at the very bottom of the tree, it represents a single fiber or voxel, for several purposes a leaf also counts as a cluster.

void WHierarchicalTreeVoxels::addLeaf ( size_t voxelnum )

A leaf is at the very bottom of the tree, it represents a single fiber or voxel, for several purposes a leaf also counts as a cluster.

Parameters:

voxelnum the voxel id for this leaf

std::vector< size_t > WHierarchicalTreeVoxels::findClustersForBranchLength	(	float	value,
		size_t	minSize = `100`
	)

finds the clusters for a given similarity value

Parameters:

value	only return clusters where the distance in energy level to its parent is large than this value
minSize	only return clusters with a number of voxels large than minSize