Parallel polygon scan conversion on hypercube multiprocessors

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the ACM Symposium on Applied Computing
PublisherAssociation for Computing Machinery
Pages110-114
Number of pages5
ISBN (Print)1581130864
Publication statusPublished - 1 Jan 1999
EventProceedings of the 1999 14th ACM Symposium on Applied Computing, SAC-99 - San Antonio, TX, USA
Duration: 28 Feb 19992 Mar 1999

Other

OtherProceedings of the 1999 14th ACM Symposium on Applied Computing, SAC-99
CitySan Antonio, TX, USA
Period28/02/992/03/99

    Fingerprint

Cite this

Jenq, J. (1999). Parallel polygon scan conversion on hypercube multiprocessors. In Proceedings of the ACM Symposium on Applied Computing (pp. 110-114). Association for Computing Machinery.