Systolic Architecture for Boolean Operations on Polygons and Polyhedra
No Thumbnail Available
Date
1987
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Publishing Ltd and the Eurographics Association
Abstract
In Computer-Aided Design applications there is often a need to compute the union, intersection and Merence of two polygons or polyhedra. The sequential algorithms for this problem are characterized by poor speed of response and large computational complexity. In order to remove these defects, an algorithm amenable to implementation on a parallel architecture is proposed. The parallel architecture designed is a systolic one which forms a dedicated subsystem to perform set-theoretic operations on polygons. The improvement in speed gained by using the systolic array as compared to a uniprocessor has been evaluated using simulation techniques. Extensions of this architecture to perform the same operations on polyhedra are also discussed.
Description
@article{10.1111:j.1467-8659.1987.tb00540.x,
journal = {Computer Graphics Forum},
title = {{Systolic Architecture for Boolean Operations on Polygons and Polyhedra}},
author = {Krishnan, D. and Patnaik, L.M.},
year = {1987},
publisher = {Blackwell Publishing Ltd and the Eurographics Association},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.1987.tb00540.x}
}