Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The complexity of the Hausdorff distance

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

DOI10.4230/LIPICS.SOCG.2022.48MaRDI QIDQ6539553

Tillmann Miltzow, Linda Kleist, Paul Jungeblut

Publication date: 14 May 2024





zbMATH Keywords

semi-algebraic setHausdorff distancecomplexity theoryexistential theory of the realsuniversal existential theory of the reals


Mathematics Subject Classification ID

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



Related Items (2)

A practical algorithm with performance guarantees for the art gallery problem ⋮ Representing matroids over the reals is \(\exists \mathbb{R}\)-complete






This page was built for publication: The complexity of the Hausdorff distance

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6539553&oldid=40063132"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 17:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki