Efficient sparse ICP
From MaRDI portal
Publication:1632310
DOI10.1016/j.cagd.2015.03.022zbMath1417.68242OpenAlexW319598780MaRDI QIDQ1632310
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
Numerical mathematical programming methods (65K05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
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
Uses Software
Cites Work
- Surface fitting and registration of point clouds using approximations of the unsigned distance function
- Combinatorial and experimental results for randomized point matching algorithms
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- VDB
This page was built for publication: Efficient sparse ICP