Approximate matching of polygonal shapes

DOI10.1007/BF01530830zbMath0855.68106OpenAlexW2039810899MaRDI QIDQ1924770

Johannes Blömer, Helmut Alt, Bernd Behrends

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

polygonal shapes

Mathematics Subject Classification ID

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

Related Items

Between shapes, using the Hausdorff distance, Can we compute the similarity between surfaces?, Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases, Curve matching, time warping, and light fields: New algorithms for computing similarity between curves, Affine invariant comparison of point-sets using convex hulls and Hausdorff distances, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Matching sets of line segments, FPTAS for minimizing the earth mover's distance under rigid transformations and related problems, The VC dimension of metric balls under Fréchet and Hausdorff distances, Approximating Gromov-Hausdorff distance in Euclidean space, A note on the Hausdorff distance between norm balls and their linear maps, The complexity of the Hausdorff distance, Hausdorff distance between convex semialgebraic sets, Fast Fréchet queries, Shape matching by random sampling, COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS, Unnamed Item, Unnamed Item, Computing the Fréchet distance between simple polygons, Hausdorff matching and Lipschitz optimization, The directed Hausdorff distance between imprecise point sets, Efficient computation of the Hausdorff distance between polytopes by exterior random covering, Unnamed Item, Shape Matching by Random Sampling, The Computational Geometry of Comparing Shapes, Relocalization -- theory and practice, On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance, Shape-constrained Gaussian process regression for surface reconstruction and multimodal, non-rigid image registration

Cites Work

• A linear time algorithm for the Hausdorff distance between convex polygons
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• Congruence, similarity, and symmetries of geometric objects
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item