ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

DOI10.1142/S0129054106004170zbMath1103.68126OpenAlexW2047370928MaRDI QIDQ5484909

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

congruencecomputational geometrypattern matchingapproximate string matchingpoint set matchinglargest common point set

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES