20 #include "../MLPointCloudUtilsSystem.h"
28 class TileSphereHashTable;
43 void setPointSets(
const std::vector<ml::Vector3>& pointCloud1,
const std::vector<ml::Vector3>& pointCloud2);
85 size_t _size1, _size2;
87 unsigned int _sphereIndex;
103 int _entries, _partition;
106 TileSphere* generateTree(
float* pointSet,
size_t size);
109 void getBB(
float* pointSet,
size_t size,
float& minX,
float& maxX,
float& minY,
float& maxY,
float& minZ,
float& maxZ);
#define MLPOINTCLOUDUTILS_EXPORT
The MinimalDistancePointClouds implements a fast nearest pair search algorithm described by Sean Quin...
void setParams(int entries, int partition)
Sets fix values for both objects for _entries and _partition.
void computeDistance(ml::Vector3 &point1, ml::Vector3 &point2)
Returns two points with minimal distance as Vector3.
void computeDistance(float *&point1, float *&point2)
Returns a copy of the both points with the minimal distance.
TileSphereHashTable * getHashTable()
Returns a pointer to the hash table.
void setFirstPointSet(const std::vector< ml::Vector3 > &pointCloud)
Sets only the first point set anew.
void setNumEntries(int entries)
This parameter describes how many points can be put as maximum into one sub sphere,...
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 setError(float error)
Describes the maintainable error. 0 = 0% and 1 = 100%. The default value is 0.
MinimalDistancePointClouds()
Constructor.
void setFirstSinglePoint(const ml::Vector3 &point)
Sets only the first point set anew, which consists only of a single point.
int getUniqueIndex()
Returns a unique index for each tile sphere.
virtual ~MinimalDistancePointClouds()
Destructor.
void verbose(bool onOff)
Dumps the console with additional debugging info.
TileSphereHashTable is used in the classes MinimalDistancePointClouds and TileSphere.
TileSphere is used in the class MinimalDistancePointClouds.