The directed Hausdorff distance between imprecise point sets
From MaRDI portal
Publication:553353
Recommendations
Cites work
- scientific article; zbMATH DE number 1786519 (Why is no real title available?)
- A sweepline algorithm for Voronoi diagrams
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximate matching of polygonal shapes
- Computing the discrete Fréchet distance with imprecise input
- 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
- On intersecting a set of parallel line segments with a convex polygon of minimum area
- Planar Formulae and Their Uses
- Stabbing parallel segments with a convex polygon
Cited in
(11)- Bounding and estimating the Hausdorff distance between real space algebraic curves
- A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
- Computing the Fréchet distance between uncertain curves in one dimension
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- Computing the discrete Fréchet distance with imprecise input
- Computing the Fréchet distance between uncertain curves in one dimension
- The maximal distance between imprecise point objects
- The directed Hausdorff distance between imprecise point sets
- Minimum color spanning circle in imprecise setup
- Minimum color spanning circle of imprecise points
- Fréchet Distance for Uncertain Curves
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)