Computing the Hausdorff Distance of Two Sets from Their Distance Functions
From MaRDI portal
Publication:5149569
DOI10.1142/S0218195920500028zbMath1465.68268arXiv1812.06740OpenAlexW2905303475MaRDI QIDQ5149569
Publication date: 11 February 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.06740
Uses Software
Cites Work
- A linear time algorithm for the Hausdorff distance between convex polygons
- Finite-element approximation of 2D elliptic optimal design
- Shapes and Geometries
- Shape optimization of a breakwater
- A fast marching level set method for monotonically advancing fronts.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the Hausdorff Distance of Two Sets from Their Distance Functions