Systolic array for all-nearest-neighbours problem
The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. This array can process a queue of ANN problems at a throughput of one ANN problem per time period, with an efficiency of 100%.
- F.P. Preparata , M.I. Shamos . (1985) , Computational geometry.
- B. Chazelle . Computational geometry on a systolic chip. IEEE Trans. , 774 - 785