Parallel Polygon Scan Conversion on Hypercube Multiprocessors
Polygon scan conversion is an important operation in rasterization process for computer graphics application. In this paper, we present parallel algorithm for converting polygon from its object space representation into its image space representation by using hypercube multiprocessors. The total number of SIMD hypercube processor is N × N. Each processor element corresponding to a picture element in the image plane. Our algorithm takes O(log2 N) time and O(1) space for general shape polygons. For convex polygon, an algorithm with O(logN) time and O(1) space was developed which is asymptotically optimal for hypercube computers.
MSU Digital Commons Citation
Jenq, John, "Parallel Polygon Scan Conversion on Hypercube Multiprocessors" (1999). Department of Computer Science Faculty Scholarship and Creative Works. 468.