SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

DOI10.1142/S0218195995000167MaRDI QIDQ4848833zbMATH OpenOpenAlexFDO

Authors Hans-Peter Lenhof, Michiel Smid

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

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

Cited in

(11)

• Offset-polygon annulus placement problems
• Geometric applications of posets
• Translating a convex polygon to contain a maximum number of points.
• Deformable spanners and applications
• ON ENUMERATING AND SELECTING DISTANCES
• Offset-polygon annulus placement problems
• Geometric applications of posets
• Dilation-optimal edge deletion in polygonal cycles
• Dilation-Optimal Edge Deletion in Polygonal Cycles
• A parallel batch-dynamic data structure for the closest pair problem
• Dynamic enumeration of similarity joins

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4848833)