Approximate decision algorithms for point set congruence

DOI10.1016/0925-7721(94)90004-3zbMath0807.68103MaRDI QIDQ1328753

Stefan Schirra, Paul J. Heffernan

Publication date: 3 August 1994

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/8864

zbMATH Keywords

computer vision; network flows; computational geometry; point matching; approximate decision algorithms

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Unnamed Item, Improvements on geometric pattern matching problems, AN APPROXIMATE MORPHING BETWEEN POLYLINES, Approximate one-to-one point pattern matching, Noisy colored point set matching, Approximate input sensitive algorithms for point pattern matching, Output sensitive algorithms for approximate incidences and their applications, Geometric pattern matching for point sets in the plane under similarity transformations, Approximate congruence in nearly linear time, Bipartite diameter and other measures under translation, Improved approximation bounds for planar point pattern matching, Matching sets of line segments, Finding Largest Common Point Sets, AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS

Cites Work

• The translation square map and approximate congruence
• Approximate decision algorithms for approximate congruence
• Geometric pattern matching in \(d\)-dimensional space
• Congruence, similarity, and symmetries of geometric objects
• A new approach to the maximum-flow problem
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item