Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search
We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space. For every fixed $1
Authors
- Morteza Monemizadeh (ORCID: https://orcid.org/0000-0002-8459-7822)
- Mohammad Taghi Hajiaghayi
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.17050
- Primary Topic
- Computational Geometry and Mesh Generation
- Type
- preprint