Abstract
We describe a new parallel polygonclipping algorithm based on a novel technique that allows a processor to compute output vertices independently of the results of the other processors. The basis for the method is a collision-free labeling scheme to compute the labels of the vertices of the output polygon. This labeling scheme depends only on the id of the vertices of the output polygon. This labeling scheme depends only on the id of the vertex in the input polygon. This procedure allows us to defer the synchronization between processors to the final stages of the algorithm, reduces the amount of overhead due to fine-grain synchronization, and helps makes the algorithm efficient.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark J (1982) The geometry engine: a VLSI geometry system for graphics. Comput Graph 16:127–133
Cole R (1988) Parallel merge sort SIAM J Comput 17:770–785
Foley J, van Dam A, Feiner SK, Hughes JF (1990) Computer Graphics, Principles and Practice. Addison-Wesley New York, N.Y., pp 124–127
Hennessy J, Patterson DA (1990) Computer architecture: quantitative approach. Morgan-Kaufman, Palo Alto, CA, pp 314–341
ICL (1980) DAP: introduction to Fortran programming, Reading, Berks, UK
IEEE (1993) Standards project: draft standard for information technology—portable operating system interface (POSIX) amendment 2: threads extension [C language] Technical Report P1003.4a Draft 7, IEEE Standards Department, New York, N.Y.
Karp RU, Ramachandran V (1988) A survey of parallel algorithms for shared-memory machines Technical Report, UCB/CSD 88/408 University of California at Berkeley, Berkeley, Calif.
Kruskal CP, Rudolph, Snir M (1985) The power of parallel prefix IEEE Transact Comput 34:965–968
Narayanaswami C, Franklin WR (1992) Boolean combinations of polygons in parallel. Proceedings of the 1992 International Conference on Parallel Processing. 3:131–135
Noga UT (1984) Sorting in parallel by double distributive partitioning BIT 27:340–346
Theoharis T, Page I (1989) Two parallel methods for polygon clipping Comput Graph Forum 8:107–114
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Narayanaswami, C. A parallel polygon-clipping algorithm. The Visual Computer 12, 147–158 (1996). https://doi.org/10.1007/BF01725102
Issue Date:
DOI: https://doi.org/10.1007/BF01725102