Computing and Combinatorics

DOI10.1007/B99243zbMATH Open1091.68110OpenAlexW2491887524MaRDI QIDQ4681183

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)

Related Items (3)

Generalized approximate algorithms for point set congruence ⋮ Matching point sets with respect to the earth mover's distance ⋮ ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

Recommendations

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

This page was built for publication: Computing and Combinatorics

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