Efficient sparse ICP

DOI10.1016/J.CAGD.2015.03.022MaRDI QIDQ1632310zbMATH OpenOpenAlexFDO

Authors Y. Aharonov

Publication date 14 December 2018

Published in Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cagd.2015.03.022

zbMATH Keywords

surface registration\(\ell_p\) minimization3D scan alignmentdigital geometry processing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2062510
• Geometry and convergence analysis of algorithms for registration of 3D shapes
• A survey of the ICP algorithm and its variants in registration of 3D point clouds
• Iterative closest geometric objects registration
• Improving ICP with easy implementation for free-form surface matching.

Cites work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Combinatorial and experimental results for randomized point matching algorithms
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Surface fitting and registration of point clouds using approximations of the unsigned distance function
• VDB

Cited in

(3)

• scientific article; zbMATH DE number 1945212 (Why is no real title available?)
• A Chebyshev metamodel based BnB approach to efficiently search global optimum for 3D ICP point set registration
• Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach

Describes a project that uses

Uses Software

• Go-ICP

This page was built for publication: Efficient sparse ICP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1632310)