Between shapes, using the Hausdorff distance
From MaRDI portal
Publication:824335
DOI10.1016/j.comgeo.2021.101817OpenAlexW3190340296MaRDI QIDQ824335
Jordi L. Vermeulen, Tillmann Miltzow, Tim Ophelders, Willem Sonke, Marc J. van Kreveld
Publication date: 15 December 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.14719
Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear time algorithm for the Hausdorff distance between convex polygons
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- A sweepline algorithm for Voronoi diagrams
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- \(\forall\exists\mathbb {R}\)-completeness and area-universality
- Approximate matching of polygonal shapes
- The Discrete Geodesic Problem
- On the Optimal Bisection of a Polygon
- Contour interpolation by straight skeletons
- Piecewise-Linear Interpolation between Polygonal Slices
- NONLINEAR INTERPOLATION BETWEEN SLICES
