The ICP algorithm return information.
Definition at line 128 of file CICP.h.
#include <mrpt/slam/CICP.h>
|
unsigned short | nIterations |
| The number of executed iterations until convergence. More...
|
|
float | goodness |
| A goodness measure for the alignment, it is a [0,1] range indicator of percentage of correspondences. More...
|
|
float | quality |
| A measure of the 'quality' of the local minimum of the sqr. error found by the method. Higher values are better. Low values will be found in ill-conditioned situations (e.g. a corridor) More...
|
|
unsigned int | cbSize |
|
◆ TReturnInfo()
mrpt::slam::CICP::TReturnInfo::TReturnInfo |
( |
| ) |
|
|
inline |
◆ cbSize
unsigned int mrpt::slam::CICP::TReturnInfo::cbSize |
◆ goodness
float mrpt::slam::CICP::TReturnInfo::goodness |
A goodness measure for the alignment, it is a [0,1] range indicator of percentage of correspondences.
Definition at line 138 of file CICP.h.
◆ nIterations
unsigned short mrpt::slam::CICP::TReturnInfo::nIterations |
The number of executed iterations until convergence.
Definition at line 137 of file CICP.h.
◆ quality
float mrpt::slam::CICP::TReturnInfo::quality |
A measure of the 'quality' of the local minimum of the sqr. error found by the method. Higher values are better. Low values will be found in ill-conditioned situations (e.g. a corridor)
Definition at line 139 of file CICP.h.