Computational aspects of the Hausdorff distance in unbounded dimension

DOI10.20382/jocg.v5i1a12zbMath1408.52019arXiv1401.1434OpenAlexW2964248397MaRDI QIDQ2968119

Stefan König

Publication date: 9 March 2017

Full work available at URL: https://arxiv.org/abs/1401.1434

zbMATH Keywords

computational complexityHelly-type theoremHausdorff distancepolynomial time algorithms

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05) Convex functions and convex programs in convex geometry (52A41) Helly-type theorems and geometric transversal theory (52A35)

Related Items (2)

A note on the Hausdorff distance between norm balls and their linear maps ⋮ Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales

This page was built for publication: Computational aspects of the Hausdorff distance in unbounded dimension