论文信息 - Parallel Implementation of Polygon Clipping Using Transputer

Parallel Implementation of Polygon Clipping Using Transputer

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.

Azzam Sleit | Wesam Almobaideen | Mohammad Qatawneh

[1] Ivan E. Sutherland,et al. Reentrant polygon clipping , 1974, Commun. ACM.

[2] Qunsheng Peng,et al. An efficient line clipping algorithm based on adaptive line rejection , 2002, Comput. Graph..

[3] Daniel C. Hyde. Introduction to the Programming Language Occam , 1995 .

[4] Brian A. Barsky,et al. An analysis and algorithm for polygon clipping , 1983, CACM.

[5] J. D. Day. A New Two Dimensional Line Clipping Algorithm for Small Windows , 1992, Comput. Graph. Forum.

[6] Brian A. Barsky,et al. A New Concept and Method for Line Clipping , 1984, TOGS.

[7] Václav Skala,et al. New Fast Line Clipping Algorithm in E 2 with O(lgN) Complexity , 1999 .

[8] Francis J. Hill. Computer Graphics Using Open GL , 1990 .

[9] Ari Rappoport,et al. An efficient algorithm for line and polygon clipping , 1991, The Visual Computer.

[10] Denis A. Nicole. Occam and Transputer Tutorial at a Conference on Economical Parallel Processing, Berne, Switzerland, May 1988 , 1988 .

[11] Borut Zalik,et al. An algorithm for polygon clipping, and for determining polygon intersections and unions , 2007, Comput. Geosci..