ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

DOI10.1142/S0129054106004170MaRDI QIDQ5484909zbMATH OpenOpenAlexFDO

Authors Tatsuya Akutsu

Publication date 21 August 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054106004170

zbMATH Keywords

computational geometrycongruencepattern matchingapproximate string matchingpoint set matchinglargest common point set

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• 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
• Graph-Based Representations in Pattern Recognition
• 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
• Combinatorial Pattern Matching

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• An application of pattern matching to a problem in geometrical complexity
• An optimal algorithm for geometrical congruence
• Approximate String Matching: A Simpler Faster Algorithm
• Approximate congruence in nearly linear time
• Combinatorial complexity bounds for arrangements of curves and spheres
• Congruence, similarity, and symmetries of geometric objects
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Extremal problems in discrete geometry
• Fast parallel and serial approximate string matching
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On determining the congruence of point sets in \(d\) dimensions

Cited in

(5)

• An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
• Computing and Combinatorics
• scientific article; zbMATH DE number 738979 (Why is no real title available?)
• Matching point sets with respect to the earth mover's distance
• Generalized approximate algorithms for point set congruence

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 Q5484909)