Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computing the Hausdorff Distance of Two Sets from Their Distance Functions

From MaRDI portal
Publication:5149569
Jump to:navigation, search

DOI10.1142/S0218195920500028zbMath1465.68268arXiv1812.06740OpenAlexW2905303475MaRDI QIDQ5149569

Daniel Kraft

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


zbMATH Keywords

error estimatedistance functionHausdorff distance


Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)



Uses Software

  • Octave
  • DLMF


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5149569&oldid=19696978"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 14:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki