Approximate decision algorithms for point set congruence

DOI10.1016/0925-7721(94)90004-3MaRDI QIDQ1328753zbMATH OpenOpenAlexFDO

Authors Paul J. Heffernan, Stefan Schirra

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

computational geometrynetwork flowscomputer visionpoint matchingapproximate decision algorithms

Mathematics Subject Classification ID

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

Recommendations

• Generalized approximate algorithms for point set congruence
• Approximate congruence in nearly linear time
• Publication:4952638
• scientific article; zbMATH DE number 49040
• Approximate decision algorithms for approximate congruence

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 3760882 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 49040 (Why is no real title available?)
• scientific article; zbMATH DE number 65738 (Why is no real title available?)
• A new approach to the maximum-flow problem
• Approximate decision algorithms for approximate congruence
• Congruence, similarity, and symmetries of geometric objects
• Geometric pattern matching in \(d\)-dimensional space
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• The translation square map and approximate congruence

Cited in

(25)

• Finding Largest Common Point Sets
• Noisy colored point set matching
• Output sensitive algorithms for approximate incidences and their applications
• Congruence testing of point sets in 4-space
• Output sensitive algorithms for approximate incidences and their applications
• Matching sets of line segments
• Improved approximation bounds for planar point pattern matching
• Approximate congruence in nearly linear time
• On computing a center persistence diagram
• Geometric pattern matching for point sets in the plane under similarity transformations
• AN APPROXIMATE MORPHING BETWEEN POLYLINES
• scientific article; zbMATH DE number 1445323 (Why is no real title available?)
• Improvements on geometric pattern matching problems
• Congruence, similarity, and symmetries of geometric objects
• scientific article; zbMATH DE number 1670646 (Why is no real title available?)
• Approximate decision algorithms for approximate congruence
• Bipartite diameter and other measures under translation
• Approximate input sensitive algorithms for point pattern matching
• scientific article; zbMATH DE number 49040 (Why is no real title available?)
• AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS
• Generalized approximate algorithms for point set congruence
• Approximate one-to-one point pattern matching
• Linear time algorithms for testing approximate congruence in the plane
• scientific article; zbMATH DE number 7559117 (Why is no real title available?)
• scientific article; zbMATH DE number 1555919 (Why is no real title available?)

This page was built for publication: Approximate decision algorithms for point set congruence

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