#include <pcl/sample_consensus/ransac.h>#include <pcl/sample_consensus/sac_model_registration.h>#include <pcl/registration/registration.h>#include <pcl/registration/transformation_estimation_svd.h>#include <pcl/registration/transformation_estimation_point_to_plane_lls.h>#include <pcl/registration/correspondence_estimation.h>#include <pcl/registration/default_convergence_criteria.h>#include <pcl/registration/impl/icp.hpp>

Go to the source code of this file.
Classes | |
| class | pcl::IterativeClosestPoint< PointSource, PointTarget, Scalar > |
| IterativeClosestPoint provides a base implementation of the Iterative Closest Point algorithm. The transformation is estimated based on Singular Value Decomposition (SVD). More... | |
| class | pcl::IterativeClosestPointWithNormals< PointSource, PointTarget, Scalar > |
| IterativeClosestPointWithNormals is a special case of IterativeClosestPoint, that uses a transformation estimated based on Point to Plane distances by default. More... | |
Namespaces | |
| namespace | pcl |