On the performance of the ICP algorithm

DOI10.1016/j.comgeo.2007.10.007zbMath1184.65025OpenAlexW2000200858MaRDI QIDQ934025

Esther Ezra, Alon Efrat, Micha Sharir

Publication date: 29 July 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.007

zbMATH Keywords

pattern matchingVoronoi diagramsHausdorff distancenearest neighborsiterative closest point (ICP) algorithm proposed

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

FPTAS for minimizing the earth mover's distance under rigid transformations and related problems, Nonrigid registration using Gaussian processes and local likelihood estimation, Surface estimation for multiple misaligned point sets

Cites Work

• How fast is the \(k\)-means method?
• An Optimal-Time Algorithm for Slope Selection
• Unnamed Item
• Unnamed Item
• Unnamed Item