Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance 
Under Translation

Bringmann, Karl; Nusser, André

doi:10.4230/LIPIcs.SoCG.2021.18

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons228472

Nusser, André
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2021/13817/pdf/LIPIcs-SoCG-2021-18.pdf
(Publisher version)

https://creativecommons.org/licenses/by/4.0/legalcode
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

LIPIcs-SoCG-2021-18.pdf
(Publisher version), 838KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., & Nusser, A. (2021). Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. In K. Buchin, & É. Colin de Verdière (Eds.), 37th International Symposium on Computational Geometry (pp. 1-17). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2021.18.

Cite as: https://hdl.handle.net/21.11116/0000-0008-DB6F-6

Abstract

There is no abstract available