MeVisLab Toolbox Reference
|
The MinimalDistancePointClouds implements a fast nearest pair search algorithm described by Sean Quinlan in 'Efficient Distance Computation between Non-Convex Objects'. More...
#include <MinimalDistancePointClouds.h>
Public Member Functions | |
MinimalDistancePointClouds () | |
Constructor. | |
virtual | ~MinimalDistancePointClouds () |
Destructor. | |
void | setPointSets (const std::vector< ml::Vector3 > &pointCloud1, const std::vector< ml::Vector3 > &pointCloud2) |
This method passes the two point clouds in the form of two standard vectors. | |
void | setFirstPointSet (const std::vector< ml::Vector3 > &pointCloud) |
Sets only the first point set anew. | |
void | setFirstSinglePoint (const ml::Vector3 &point) |
Sets only the first point set anew, which consists only of a single point. | |
void | setNumEntries (int entries) |
This parameter describes how many points can be put as maximum into one sub sphere, but the designed value can be lower. | |
void | setParams (int entries, int partition) |
Sets fix values for both objects for _entries and _partition . | |
void | setError (float error) |
Describes the maintainable error. 0 = 0% and 1 = 100%. The default value is 0. | |
void | computeDistance (float *&point1, float *&point2) |
Returns a copy of the both points with the minimal distance. | |
void | computeDistance (ml::Vector3 &point1, ml::Vector3 &point2) |
Returns two points with minimal distance as Vector3. | |
int | getUniqueIndex () |
Returns a unique index for each tile sphere. | |
TileSphereHashTable * | getHashTable () |
Returns a pointer to the hash table. | |
void | verbose (bool onOff) |
Dumps the console with additional debugging info. | |
The MinimalDistancePointClouds implements a fast nearest pair search algorithm described by Sean Quinlan in 'Efficient Distance Computation between Non-Convex Objects'.
Definition at line 33 of file MinimalDistancePointClouds.h.
ml::MinimalDistancePointClouds::MinimalDistancePointClouds | ( | ) |
Constructor.
|
virtual |
Destructor.
Returns a copy of the both points with the minimal distance.
The method setPointSets
must have been called before.
void ml::MinimalDistancePointClouds::computeDistance | ( | ml::Vector3 & | point1, |
ml::Vector3 & | point2 ) |
Returns two points with minimal distance as Vector3.
The method setPointSets
must have been called before.
TileSphereHashTable * ml::MinimalDistancePointClouds::getHashTable | ( | ) |
Returns a pointer to the hash table.
int ml::MinimalDistancePointClouds::getUniqueIndex | ( | ) |
Returns a unique index for each tile sphere.
Describes the maintainable error. 0 = 0% and 1 = 100%. The default value is 0.
void ml::MinimalDistancePointClouds::setFirstPointSet | ( | const std::vector< ml::Vector3 > & | pointCloud | ) |
Sets only the first point set anew.
The second one (with all its TileSphere tree computations) is left as it was.
void ml::MinimalDistancePointClouds::setFirstSinglePoint | ( | const ml::Vector3 & | point | ) |
Sets only the first point set anew, which consists only of a single point.
The second pointSet is left as it was.
This parameter describes how many points can be put as maximum into one sub sphere, but the designed value can be lower.
The default value is 2000. The concrete value for _entries
and _partition
will be computed automatically.
Sets fix values for both objects for _entries
and _partition
.
void ml::MinimalDistancePointClouds::setPointSets | ( | const std::vector< ml::Vector3 > & | pointCloud1, |
const std::vector< ml::Vector3 > & | pointCloud2 ) |
This method passes the two point clouds in the form of two standard vectors.
Dumps the console with additional debugging info.