Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1141.68658OpenAlexW3010016474MaRDI QIDQ5394271FDOQ5394271

Authors: Minkyoung Cho, David M. Mount 

Publication date: 25 October 2006

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

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

Recommendations

• Improved approximation bounds for planar point pattern matching
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate input sensitive algorithms for point pattern matching
• Approximate one-to-one point pattern matching
• Combinatorial Pattern Matching

Mathematics Subject Classification ID

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

Cited In (9)

• Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation
• Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate input sensitive algorithms for point pattern matching
• Title not available (Why is that?)
• Matching sets of line segments
• A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
• Improved Grid Map Layout by Point Set Matching
• Improved approximation bounds for planar point pattern matching

This page was built for publication: Algorithms and Data Structures

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