Constant time algorithms for the 3-d all nearest neighbor problem on the LARPBS

Authors:
Yuh-Rau Wang;Shi-Jinn Horng
Affiliations:
Department of Computer Science and Information Engineering, St. John’s & St. Mary’s Institute of Technology, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Year:
2004

Citing 4
Cited 0

Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal
An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two O(1) time algorithms for solving the 3-D all nearest neighbor (3D_ANN) problem of n points using an LARPBS of size $\frac{1}{2}n^{\frac{7}{4}+\epsilon}$ and $\frac{1}{2}n^{\frac{3}{2}+\epsilon}$ respectively are proposed. To the best of our knowledge, all results derived above are the best O(1) time 3D_ANN algorithms known.