A note concerning the closest point pair algorithm.

DOI10.1016/S0020-0190(01)00268-XMaRDI QIDQ1853012zbMATH OpenOpenAlexFDO

Authors Martin Richards

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00268-x

zbMATH Keywords

Analysis of algorithmsMergesortClosest point pair algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• An improved algorithm for finding the closest pair of points
• A Randomized Algorithm for Closest-Point Queries
• A new algorithm for finding closest pair of vectors (extended abstract)
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• scientific article; zbMATH DE number 1424308
• Verification of Closest Pair of Points Algorithms
• On the complexity of closest pair via polar-pair of point-sets
• On the complexity of closest pair via polar-pair of point-sets

Cited in

(5)

• Two-dimensional closest pair problem: a closer look
• Pyramid computer solutions of the closest pair problem
• An improved algorithm for finding the closest pair of points
• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
• The average performance analysis of a closest‐pair algorithm

This page was built for publication: A note concerning the closest point pair algorithm.

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