### 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(log^{2} 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 language | English |
---|---|

Title of host publication | Proceedings of the ACM Symposium on Applied Computing |

Publisher | Association for Computing Machinery |

Pages | 110-114 |

Number of pages | 5 |

ISBN (Print) | 1581130864 |

State | Published - 1 Jan 1999 |

Event | Proceedings of the 1999 14th ACM Symposium on Applied Computing, SAC-99 - San Antonio, TX, USA Duration: 28 Feb 1999 → 2 Mar 1999 |

### Other

Other | Proceedings of the 1999 14th ACM Symposium on Applied Computing, SAC-99 |
---|---|

City | San Antonio, TX, USA |

Period | 28/02/99 → 2/03/99 |

### Fingerprint

### Cite this

*Proceedings of the ACM Symposium on Applied Computing*(pp. 110-114). Association for Computing Machinery.

}

*Proceedings of the ACM Symposium on Applied Computing.*Association for Computing Machinery, pp. 110-114, Proceedings of the 1999 14th ACM Symposium on Applied Computing, SAC-99, San Antonio, TX, USA, 28/02/99.

**Parallel polygon scan conversion on hypercube multiprocessors.** / Jenq, John.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

TY - GEN

T1 - Parallel polygon scan conversion on hypercube multiprocessors

AU - Jenq, John

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032667511&partnerID=8YFLogxK

M3 - Conference contribution

SN - 1581130864

SP - 110

EP - 114

BT - Proceedings of the ACM Symposium on Applied Computing

PB - Association for Computing Machinery

ER -