|
MeVisLab Toolbox Reference
|
TileSphereHashTable is used in the classes MinimalDistancePointClouds and TileSphere.
More...
#include <TileSphereHashTable.h>
Public Member Functions | |
| TileSphereHashTable () | |
| Constructor. | |
| virtual | ~TileSphereHashTable () |
| Destructor. | |
| void | addPair (TileSphere *tileSphere1, TileSphere *tileSphere2) |
| Adds a pair of spheres into the hash table. | |
| bool | existPair (TileSphere *tileSphere1, TileSphere *tileSphere2) |
| Checks whether the given pair exists or not. | |
| void | getStatistics (int &addedPairs, int &hits, int &misses) |
| Hash table statistics. | |
TileSphereHashTable is used in the classes MinimalDistancePointClouds and TileSphere.
The TileSphereHashTable is the underlying data structure for a fast nearest pair search algorithm described by Sean Quinlan in 'Efficient Distance Computation between Non-Convex Objects'.
Definition at line 32 of file TileSphereHashTable.h.
| ml::TileSphereHashTable::TileSphereHashTable | ( | ) |
Constructor.
|
virtual |
Destructor.
| void ml::TileSphereHashTable::addPair | ( | TileSphere * | tileSphere1, |
| TileSphere * | tileSphere2 | ||
| ) |
Adds a pair of spheres into the hash table.
| bool ml::TileSphereHashTable::existPair | ( | TileSphere * | tileSphere1, |
| TileSphere * | tileSphere2 | ||
| ) |
Checks whether the given pair exists or not.
| void ml::TileSphereHashTable::getStatistics | ( | int & | addedPairs, |
| int & | hits, | ||
| int & | misses | ||
| ) |
Hash table statistics.