Parallel polygon scan conversion on hypercube multiprocessors

Document Type

Conference Proceeding

Publication Date

1-1-1999

Journal / Book Title

Proceedings of the ACM Symposium on Applied Computing

Abstract

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.

DOI

10.1145/298151.298215

Published Citation

Jenq, J. J. F. (1999). Parallel polygon scan conversion on hypercube multiprocessors. In Proceedings of the ACM Symposium on Applied Computing (pp. 110-114). (Proceedings of the ACM Symposium on Applied Computing). Association for Computing Machinery. https://doi.org/10.1145/298151.298215

Link to Full Text

Share

COinS