Abstract
This paper describes systolic algorithms for a number of geometric problems. For the sake of realism we restrict our investigation to one-dimensional arrays whose communication links with the outside are located at the end cells. Implementations yielding maximal throughput are given for solving dynamic versions of convex hull, inclusion, range and intersection search, planar point location, intersection, triangulation, and closest-point problems.
Original language | English (US) |
---|---|
Pages (from-to) | 774-785 |
Number of pages | 12 |
Journal | IEEE Transactions on Computers |
Volume | C-33 |
Issue number | 9 |
DOIs | |
State | Published - Sep 1984 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Keywords
- Analysis of algorithms
- VLSI
- computational geometry
- convolution
- parallel computation
- pipelining real-time algorithms
- systolic arrays