A matcher links points in the reading to points in the reference. More...
#include <PointMatcher.h>
Public Member Functions | |
| Matcher () | |
| Construct without parameter. | |
| Matcher (const std::string &className, const ParametersDoc paramsDoc, const Parameters ¶ms) | |
| Construct with parameters. | |
| virtual | ~Matcher () |
| virtual destructor | |
| void | resetVisitCount () |
| Reset the visit counter. | |
| unsigned long | getVisitCount () const |
| Return the visit counter. | |
| virtual void | init (const DataPoints &filteredReference)=0 |
| Init this matcher to find nearest neighbor in filteredReference. | |
| virtual Matches | findClosests (const DataPoints &filteredReading)=0 |
| Find the closest neighbors of filteredReading in filteredReference passed to init(). | |
Public Attributes | |
| unsigned long | visitCounter |
| number of points visited | |
A matcher links points in the reading to points in the reference.
This typically uses a space-partitioning structure such as a kd-tree for performance optimization.
1.6.3