#include "DAGH.h"
#include <climits>
Functions | |
void | Cluster_Prune (GridData< int, 1 > &sig, int &pl, int &pu, int bw) |
Prunes out external zeros and returns a lower and upper bound for prune locations. | |
void | Cluster_Slice (GridData< int, 1 > &sig, int &slice, int &str, int bw) |
Looks for a laplacian or zero slice in the internal grid area. | |
void | Cluster3R (GridData< short, 3 > &flag, const BBox &flagbbox, double Efficiency, int MinWidth, int MaxWidth, BBoxList &recurseOnThis) |
The recursive clustering algorithm. | |
template<> | |
void | Cluster (GridData< short, 2 > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &Result) |
A 2D interface to the recursive clustering algorithm Cluster3R(). | |
template<> | |
void | Cluster (GridData< short, 3 > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &Result) |
A 3D interface to the recursive clustering algorithm Cluster3R(). |
There is also a 2-D interface.
void Cluster | ( | GridData< short, 3 > & | flag, | |
BBoxList & | bblexclude, | |||
double | Efficiency, | |||
int | MinWidth, | |||
int | MaxWidth, | |||
int | BufferWidth, | |||
BBoxList & | Result | |||
) |
A 3D interface to the recursive clustering algorithm Cluster3R().
flag | GridData<short,3>. Flag array for clustering. | |
bblexclude | BBoxList. Flags not considered in this region. | |
Efficiency | double. | |
MinWidth | int. | |
MaxWidth | int. | |
BufferWidth | int. | |
Result | BBoxList. Result is returned in here |
void Cluster | ( | GridData< short, 2 > & | flag, | |
BBoxList & | bblexclude, | |||
double | Efficiency, | |||
int | MinWidth, | |||
int | MaxWidth, | |||
int | BufferWidth, | |||
BBoxList & | Result | |||
) |
A 2D interface to the recursive clustering algorithm Cluster3R().
flag | GridData<short,2>. Flag array for clustering. | |
bblexclude | BBoxList. Flags not considered in this region. | |
Efficiency | double. | |
MinWidth | int. | |
MaxWidth | int. | |
BufferWidth | int. | |
Result | BBoxList. Result is returned in here |
void Cluster3R | ( | GridData< short, 3 > & | flag, | |
const BBox & | flagbbox, | |||
double | Efficiency, | |||
int | MinWidth, | |||
int | MaxWidth, | |||
BBoxList & | recurseOnThis | |||
) |
The recursive clustering algorithm.
Calls Cluster_Prune(), Cluster_Slice().
flag | GridData<short,3>. Flag array for clustering. | |
flagbbox | BBox. | |
Efficiency | double. | |
MinWidth | int. | |
MaxWidth | int. | |
recurseOnThis | BBoxList. Result is returned in here |
void Cluster_Prune | ( | GridData< int, 1 > & | sig, | |
int & | pl, | |||
int & | pu, | |||
int | bw | |||
) |
Prunes out external zeros and returns a lower and upper bound for prune locations.
void Cluster_Slice | ( | GridData< int, 1 > & | sig, | |
int & | slice, | |||
int & | str, | |||
int | bw | |||
) |
Looks for a laplacian or zero slice in the internal grid area.
Since prune has already been called, we know this will happen inside!