SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

DOI10.1142/S0218195995000167zbMath0939.68877OpenAlexW2162487598MaRDI QIDQ4848833

Michiel H. M. Smid, Hans-Peter Lenhof

Publication date: 26 February 1996

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (9)

DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES ⋮ Geometric Applications of Posets ⋮ Dilation-Optimal Edge Deletion in Polygonal Cycles ⋮ Translating a convex polygon to contain a maximum number of points. ⋮ ON ENUMERATING AND SELECTING DISTANCES ⋮ Deformable spanners and applications ⋮ Offset-polygon annulus placement problems ⋮ Offset-polygon annulus placement problems ⋮ Geometric applications of posets

This page was built for publication: SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM