vtf-logo

Cluster1.C File Reference

A 1D "clustering" algorithm. More...

#include "DAGH.h"

Functions

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.


Detailed Description

A 1D "clustering" algorithm.

1D clustering is really easy, so this is really short.

Date:
Apr-1996
Author:
Paul Walker

Function Documentation

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.

Assume flag is a 1D real array with values of 0.0 or 1.0 for flag or no flag.

Parameters:
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
Date:
Apr-1996
Author:
Paul Walker


Generated on Fri Aug 24 13:00:29 2007 for AMROC's Hierachical Data Structures - by  doxygen 1.4.7