Given a collection of non-intersecting simple polygons possibly with holes and with a total of n edges in three-dimensional space; parallel algorithms are given for the problems called hidden-line and hidden-surface removal in computer graphics. More precisely, algorithms are proposed to find the portions of the edges visible from (0,0, ∞) and to find the upper envelope (i.e., the pointwise maximum) of the polygons. The proposed solution for the hidden-ine problem is the parallelization of the optimal sequential algorithm given by Dévai in 1986. As the optimal sequential algorithm for the hidden-surface problem given by McKenna in 1987 is rather involved, a new optimal sequential algorithm is proposed, which is amenable to parallelization and might also have practical significance in its own right. Both of the parallel hidden-line and hidden-surface algorithms take Θ(logn) time using n 2/logn CREW PRAM processors. © 2011 Springer-Verlag.
CITATION STYLE
Dévai, F. (2011). An optimal hidden-surface algorithm and its parallelization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6784 LNCS, pp. 17–29). https://doi.org/10.1007/978-3-642-21931-3_2
Mendeley helps you to discover research relevant for your work.