Go to the documentation of this file.
6 #ifndef aglowavTree02_hh
7 #define aglowavTree02_hh
20 template<
class BiClNode>
61 #endif // aglowavTree02_hh
Abstract class for a space.
uint nclst() const
Number of clusters.
BiClNode * constructor_(BiClNode *lfset, cluster::CebyCenter< BiClNode > &cby)
Private constructor for recursive calls.
const BiClNode * root() const
Root of the tree.
Binary tree for the cluster and agglomeration algorithm.
uint nlf_
Number of leafs.
Abstract class to compute a bounding ball of an element (the leafs of a cluster tree).
Class to compute the Cebysev ball of a point set, i.e., the smallest ball containing all points.
Abstract class for a cluster tree.
uint nleaf() const
Number of leafs.
Traits for the binary cluster tree algorithm.
cluster::TreeTraits< BiClNode >::F F
Type of element (Real || Cmplx)
void destructor_(BiClNode *nd)
Private destructor for recursive calls.
BiClNode * root_
Root of the tree.
Tree02(const concepts::Space< F > &spc, const cluster::BBall< F > &ball)
Constructor.
Used for the aglowav classes for the boundary element method.
ClstBiTreeTraits< BiClNode > Traits
How a node has to behave.
uint nclst_
Number of clusters.