A 1D "clustering" algorithm. More...
#include "DAGH.h"
Functions | |
template<int dim> | |
void | Cluster (GridData< short, dim > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &Result) |
template<> | |
void | Cluster (GridData< short, 1 > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &result) |
Clusters a grid function flag into a list of bounding boxes result . |
A 1D "clustering" algorithm.
1D clustering is really easy, so this is really short.
void Cluster | ( | GridData< short, 1 > & | flag, | |
BBoxList & | bblexclude, | |||
double | Efficiency, | |||
int | MinWidth, | |||
int | MaxWidth, | |||
int | BufferWidth, | |||
BBoxList & | result | |||
) | [inline] |
Clusters a grid function flag
into a list of bounding boxes result
.
Assume flag
is a 1D real array with values of 0.0 or 1.0 for flag or no flag.
flag | GridData<short,1>. Array of points to cluster | |
bblexclude | BBoxList. Flags not considered in this region. | |
Efficiency | double. | |
MinWidth | int. | |
MaxWidth | int. | |
BufferWidth | int. | |
result | BBoxList. The resulting BBoxList of the clustering algorithm |
References Bucket< Type >::add(), add(), Bucket< Type >::first(), for_1, Bucket< Type >::next(), and BBox::upper().