Fast algorithms for approximating distances

DOI10.1007/S00453-001-0114-7zbMath1052.68145OpenAlexW1966685253MaRDI QIDQ1601023

Sergei Bespamyatnikh, Michael Segal

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0114-7

zbMATH Keywords

well-separated pair decompositiondistance selection problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

A fast robust algorithm for computing discrete Voronoi diagrams ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition

This page was built for publication: Fast algorithms for approximating distances