Algorithms for point set matching with k-differences

DOI10.1007/978-3-540-27798-9_28MaRDI QIDQ4681183zbMATH OpenOpenAlexFDO

Authors Tatsuya Akutsu

Publication date 15 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99243

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• An algorithm for matching point sets using the \(l_1\) norm
• Point set pattern matching in \(d\)-dimensions
• Approximating the problem, not the solution: an alternative view of point set matching
• Approximating the problem, not the solution: An alternative view of point set matching
• Algorithms – ESA 2005
• Matching point sets with respect to the earth mover's distance
• Point pattern matching algorithm for planar point sets under Euclidean transform
• Generalized approximate algorithms for point set congruence
• Approximate point set pattern matching on sequences and planes

Cited in

(6)

• Matching point sets with respect to the earth mover's distance
• Point set pattern matching in 3-D
• An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
• scientific article; zbMATH DE number 738979 (Why is no real title available?)
• Generalized approximate algorithms for point set congruence
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

This page was built for publication: Algorithms for point set matching with \(k\)-differences

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