ml::TileSphereHashTable Class Reference

TileSphereHashTable is used in the classes MinimalDistancePointClouds and TileSphere. More...

#include <TileSphereHashTable.h>

List of all members.

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.

---

Detailed Description

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 30 of file TileSphereHashTable.h.

---

Constructor & Destructor Documentation

ml::TileSphereHashTable::TileSphereHashTable

(

)

Constructor.

virtual ml::TileSphereHashTable::~TileSphereHashTable

(

)

[virtual]

Destructor.

---

Member Function Documentation

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.

---

The documentation for this class was generated from the following file:

• MeVisLab/Standard/Sources/Shared/MLPointCloudUtils/MLMinimalDistancePointClouds/TileSphereHashTable.h