scientific article; zbMATH DE number 1445323

MaRDI QIDQ4952638zbMATH OpenFDO

Authors Suresh Venkatasubramanian, Piotr Indyk

Publication date 10 May 2000

zbMATH Keywords

algorithmsbottleneck matching distancecombinatorial matching problemcomputational geometrygeometric matching problemHausdorff distancemetric entropy

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Recommendations

• Approximate congruence in nearly linear time
• scientific article; zbMATH DE number 1305437
• Approximate decision algorithms for point set congruence
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate one-to-one point pattern matching

Cited in

(9)

• Approximate decision algorithms for approximate congruence
• Approximate decision algorithms for point set congruence
• Approximate congruence in nearly linear time
• Combinatorial and experimental methods for approximate point pattern matching
• Improved approximation bounds for planar point pattern matching
• Linear Approximations of Addition Modulo 2n-1
• Approximate one-to-one point pattern matching
• Fast Software Encryption
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points

This page was built for publication:

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