On matching point configurations

MaRDI QIDQ5224650zbMATH OpenFDO

Authors David Jiménez, Guergana Petrova

Publication date 24 July 2019

zbMATH Keywords

matching point configurationsorthogonal Procrustes problemperturbation bounds

Mathematics Subject Classification ID

Computational issues in computer and robotic vision (65D19) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• scientific article; zbMATH DE number 1305437
• An algorithm for matching point sets using the \(l_1\) norm
• Point set pattern matching in 3-D
• scientific article; zbMATH DE number 1555919

Cited in

(10)

• The complexity of point configurations
• Delaunay triangulation of manifolds
• On a matching problem in the plane
• An algorithm for matching point sets using the \(l_1\) norm
• scientific article; zbMATH DE number 3913175 (Why is no real title available?)
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• scientific article; zbMATH DE number 2068455 (Why is no real title available?)
• Rotating Multiple Sets of Labeled Points to Bring Them Into Close Coincidence: A Generalized Wahba Problem
• scientific article; zbMATH DE number 2200862 (Why is no real title available?)
• Non-crossing matchings of points with geometric objects

This page was built for publication: On matching point configurations

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