The directed Hausdorff distance between imprecise point sets

DOI10.1016/J.TCS.2011.01.039zbMATH Open1217.68229OpenAlexW2025309272MaRDI QIDQ553353FDOQ553353

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

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

Recommendations

• The directed Hausdorff distance between imprecise point sets
• Computing the discrete Fréchet distance with imprecise input
• Computing the discrete Fréchet distance with imprecise input
• Approximating largest convex hulls for imprecise points
• Approximating Largest Convex Hulls for Imprecise Points

zbMATH Keywords

Hausdorff distanceshape matchingimpreciseness

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Bounding and estimating the Hausdorff distance between real space algebraic curves
• The maximal distance between imprecise point objects
• Fréchet Distance for Uncertain Curves
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• Computing the Fréchet distance between uncertain curves in one dimension
• The directed Hausdorff distance between imprecise point sets
• Computing the Fréchet distance between uncertain curves in one dimension
• Minimum color spanning circle of imprecise points
• Computing the discrete Fréchet distance with imprecise input
• A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
• Minimum color spanning circle in imprecise setup

This page was built for publication: The directed Hausdorff distance between imprecise point sets

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