Blockstructured Adaptive Mesh Refinement in object-oriented C++
#include "DAGH.h"
#include "values.h"
Include dependency graph for Cluster3.C:
Go to the source code of this file.
Defines | |
#define | MAXPOINTS (10000) |
#define | MAXPOINTS2 (100000000) |
#define | MIN_EFFICIENCY (0.4) |
#define | MINOFF (4) |
#define | ITHRES (2) |
Functions | |
void | Cluster_Prune (GridData< int > &sig, int &pl, int &pu, int bw) |
Prunes out external zeros and returns a lower and upper bound for prune locations. More... | |
void | Cluster_Slice (GridData< int > &sig, int &slice, int &str, int bw) |
Looks for a laplacian or zero slice in the internal grid area. More... | |
void | Cluster3R (GridData< short > &flag, const BBox &flagbbox, double Efficiency, int MinWidth, int MaxWidth, BBoxList &recurseOnThis) |
The recursive clustering algorithm. More... | |
void | Cluster2 (GridData< short > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &Result) |
void | Cluster3 (GridData< short > &flag, BBoxList &bblexclude, double Efficiency, int MinWidth, int MaxWidth, int BufferWidth, BBoxList &Result) |
There is also a 2-D interface.
Definition in file Cluster3.C.
|
The recursive clustering algorithm. Calls Cluster_Prune(), Cluster_Slice().
Definition at line 166 of file Cluster3.C. References BBoxList::add(), Cluster2(), Cluster3(), Cluster_Prune(), Cluster_Slice(), BBox::extents(), Bucket< BBox >::first(), BBox::lower(), Bucket< BBox >::next(), BBox::size(), BBox::stepsize(), and BBox::upper(). |
|
Prunes out external zeros and returns a lower and upper bound for prune locations.
Definition at line 28 of file Cluster3.C. Referenced by Cluster3R(). |
|
Looks for a laplacian or zero slice in the internal grid area. Since prune has already been called, we know this will happen inside!
Definition at line 69 of file Cluster3.C. Referenced by Cluster3R(). |
Quickstart Users Guide Programmers Reference Installation Examples Download
AMROC Main Home Contactlast update: 06/01/04