A Polynomial Coreset for Furthest Neighbor in Planar Metrics

Kacper Kluk, Hung Le, Wojciech Nadara +3

A furthest neighbor data structure on a metric space $(V,\mathrm{dist})$ and a set $P\subseteq V$ answers the following query: given $v\in V$, output $p\in P$ maximizing $\mathr…