Abstract
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%.
| Original language | English |
|---|---|
| Pages (from-to) | 1259-1260 |
| Number of pages | 2 |
| Journal | Electronics Letters |
| Volume | 23 |
| Issue number | 24 |
| Publication status | Published - 1987 |
| Externally published | Yes |
Keywords
- Nearest neighbours
- Computational geometry
- Systolic arrays
- Computers