English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

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
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
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. Journal of Computational Geometry, 13(2), 30-50. doi:10.20382/jocg.v13i2a3.


Cite as: https://hdl.handle.net/21.11116/0000-000C-2690-6
Abstract
There is no abstract available