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%.
- Preparata, F.P., Shamos, M.I.: , Computational geometry, 1985 (Springer-VerlagNew York)
- 1 onward links are available for this reference.
- Chazelle, B.: `Computational geometry on a systolic chip', IEEE Trans., 1984, p. 774-785