The average performance analysis of a closest‐pair algorithm

DOI10.1080/00207168408803430zbMath0547.68045OpenAlexW2056998592MaRDI QIDQ3339288

Ruei-Chuan Chang, Richard Chia-Tung 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

computational geometryprobabilistic analysis of algorithmsaverage case performancegeometric probabiliyplanar closest pair problem

Mathematics Subject Classification ID

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

Related Items (1)

Computing relative neighbourhood graphs in the plane

Cites Work

• Unnamed Item
• Multidimensional divide-and-conquer
• The extendible cell method for closest point problems
• Finding nearest neighbours
• Divide and conquer for linear expected time
• A note on Rabin's nearest-neighbor algorithm
• On the homogeneous planar Poisson point process
• Stochastic Point Processes: Limit Theorems
• A Lower Bound for the Expected Travel Among $m$ Random Points

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