The directed Hausdorff distance between imprecise point sets

DOI10.1016/j.tcs.2011.01.039zbMath1217.68229OpenAlexW2025309272MaRDI 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 distanceshape matchingimpreciseness

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Hausdorff and packing measures (28A78)

Related Items

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

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