The average performance analysis of a closest‐pair algorithm

DOI10.1080/00207168408803430MaRDI QIDQ3339288zbMATH OpenOpenAlexFDO

Authors R. C. Chang, R. C. T. Lee

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803430

zbMATH Keywords

average case performancecomputational geometrygeometric probabiliyplanar closest pair problemprobabilistic analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Two-dimensional closest pair problem: a closer look
• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case
• A note concerning the closest point pair algorithm.
• Dynamic closest pairs — A probabilistic approach
• A Reliable Randomized Algorithm for the Closest-Pair Problem

Cites work

• A Lower Bound for the Expected Travel Among m Random Points
• A note on Rabin's nearest-neighbor algorithm
• Divide and conquer for linear expected time
• Finding nearest neighbours
• scientific article; zbMATH DE number 3571501 (Why is no real title available?)
• Multidimensional divide-and-conquer
• On the homogeneous planar Poisson point process
• Stochastic Point Processes: Limit Theorems
• The extendible cell method for closest point problems

Cited in

(2)

• Computing relative neighbourhood graphs in the plane
• An optimized divide-and-conquer algorithm for the closest-pair problem in the planar case

This page was built for publication: The average performance analysis of a closest‐pair algorithm

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