Computational Geometry on a Systolic Chip
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
This paper describes systolic algorithms for a number of geometric problems. Implementations yielding maximal throughput are given for solving dynamic versions of convex hull, inclusion, range and inverse range search, planar point location, intersection, triangulation, and closest-point problems.
- Electrical and Electronic Equipment
- Theoretical Mathematics
- Computer Hardware