Sign inSubmit
ArticleMetrics
Research Article · Free to read · Published 28 February 2009

Parallel Implementation of Polygon Clipping Using Transputer

Mohammad Qatawneh, Azzam Sleit & Wesam Almobaideen

American Journal of Applied Sciences, Volume 6, Issue 2, pp. 214–218 · doi.org/10.3844/ajassp.2009.214.218

7,385 accesses5,235 downloads3 citations (Crossref)Metrics
Cite Check for updates

Abstract

This research describes a parallel implementation of Liang-Barsky clipping algorithm on a pipeline network configuration. The implemented configuration uses pipeline of four transputers and programmed under Occam2 language. In order to achieve the concurrency, to improve the performance and to cut down the hold-ups caused by the calculation of intersection, data buffering is used.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Qatawneh, M., Sleit, A. & Almobaideen, W. (2009). Parallel Implementation of Polygon Clipping Using Transputer. American Journal of Applied Sciences, 6(2), 214–218. https://doi.org/10.3844/ajassp.2009.214.218

Licence
© Science Publications
Issue
Volume 6, Issue 2
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Parallel Implementation of Polygon Clipping Using TransputerAmerican Journal of Applied Sciences · Volume 6, Issue 2 · pp. 214–218 · © Science PublicationsDownload