The directed Hausdorff distance between imprecise point sets

DOI10.1016/j.tcs.2011.01.039zbMath1217.68229MaRDI QIDQ553353

Maarten Löffler, Thomas Wolle, Christian Knauer, Marc Scherfenberg

Publication date: 27 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.039

zbMATH Keywords

Hausdorff distance; shape matching; impreciseness

Mathematics Subject Classification ID

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

28A78: Hausdorff and packing measures

Related Items

COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT, Computing the Fréchet distance between uncertain curves in one dimension, Computing the Fréchet distance between uncertain curves in one dimension, Fréchet Distance for Uncertain Curves, Bounding and estimating the Hausdorff distance between real space algebraic curves, Minimum color spanning circle of imprecise points, A fully polynomial time approximation scheme for the smallest diameter of imprecise points, Minimum color spanning circle in imprecise setup, A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints

Cites Work

• Unnamed Item
• A sweepline algorithm for Voronoi diagrams
• Approximate matching of polygonal shapes
• Largest bounding box, smallest diameter, and related problems on imprecise points
• On intersecting a set of parallel line segments with a convex polygon of minimum area
• Computing the Discrete Fréchet Distance with Imprecise Input
• ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
• Planar Formulae and Their Uses
• Stabbing parallel segments with a convex polygon
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs