#include <AreaSumTableQuadtree.h>
List of all members.
Classes |
class | BranchNode |
class | HorizontalBranchNode |
class | LeafNode |
class | Node |
class | RectangularBranchNode |
class | VerticalBranchNode |
Public Member Functions |
| AreaSumTableQuadtree (const T ar[], unsigned int width, unsigned int height, const T &threshold) |
unsigned int | getWidth () const |
unsigned int | getHeight () const |
const T & | operator() (unsigned int x, unsigned int y) const |
unsigned int | getLevel (unsigned int x, unsigned int y) const |
unsigned int | getNodeCount () const |
Detailed Description
template<typename T>
class za_co_codespot::datastructures::AreaSumTableQuadtree< T >
An implementation of a region quadtree that represents a rectangle and provides access through 2D indexing. The tree is static, that is, no modification of the data is allowed.
This implementation use area sum tables to perform fast mean and variance calculations.
- Template Parameters:
-
| T | A type of the Order2Statistical concept, for instance int or float. |
For now, the interface is exactly the same as NaiveQuadtree - see that class for documentation on the class interface.
Definition at line 27 of file AreaSumTableQuadtree.h.
The documentation for this class was generated from the following file: