Pyramid computer solutions of the closest pair problem

DOI10.1016/0196-6774(85)90038-0MaRDI QIDQ3723722zbMATH OpenOpenAlexFDO

Authors Q. F. Stout

Publication date 1985

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(85)90038-0

zbMATH Keywords

pattern recognitioncomputational geometryimage processingparallel computationparallel computers

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80)

Recommendations

• A Reliable Randomized Algorithm for the Closest-Pair Problem
• A sharper analysis of a prallel algorithm for the all pairs shortest path problem
• A note concerning the closest point pair algorithm.
• An optimal algorithm for the on-line closest-pair problem
• Parallel computation of distance transforms

Cited in

(2)

• Parallel computation of discrete Voronoi diagrams (extended abstract)
• Parallel computation of distance transforms

This page was built for publication: Pyramid computer solutions of the closest pair problem

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