Approximate decision algorithms for point set congruence

DOI10.1016/0925-7721(94)90004-3zbMath0807.68103OpenAlexW2212031862MaRDI 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 visionnetwork flowscomputational geometrypoint matchingapproximate decision algorithms

Mathematics Subject Classification ID

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

Related Items

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

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