FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE

DOI10.1142/S0218195995000040zbMath0818.68141OpenAlexW2127371054MaRDI QIDQ4698351

Kazuo Iwano, Naoki Katoh

Publication date: 22 August 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195995000040

zbMATH Keywords

Voronoi diagramsgeometric enumeration problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items

Group nearest-neighbor queries in the \(L_1\) plane ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems ⋮ Geometric applications of posets ⋮ Toward Tight Approximation Bounds for Graph Diameter and Eccentricities ⋮ Approximate \(k\)-closest-pairs in large high-dimensional data sets