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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search

Morteza Monemizadeh, Mohammad Taghi Hajiaghayi
arXiv (Cornell University)
Computational Geometry and Mesh Generation
preprint

Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search

Morteza Monemizadeh, Mohammad Taghi Hajiaghayi
preprint en

Abstract

We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space. For every fixed $1

arXiv (Cornell University)
Computational Geometry and Mesh Generation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon