An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
نویسندگان
چکیده
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in O(log n) steps on the CREW PRAM model with a work bound of O((n + k)polylog(n)) where n and k are the input and output sizes respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data-structures is somewhat novel in the context of parallel algorithms. To the best of our knowledge this is the most efficient parallel algorithm for hidden-surface removal for an important class of 3-D scenes.
منابع مشابه
An Efficient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains*
In this paper, we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain maps. A distinguishing feature of our algorithm is that its running time is sensitive to the actual size of the visible image, rather than the total number of intersections in th...
متن کاملAn E cient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains
In this paper we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain maps. A distinguishing feature of our algorithm is that its running time is sensitive to the actual size of the visible image, rather than the total number of intersections in the...
متن کاملOutput-Sensitive Hidden Surface Elimination for Rectangles
We present an algorithm for the well-known bidden·surface elimination problem for redangles, which is also known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1.5 + k), where k is the size of the output (which can be as large as 6(n2 )). For values of kin the range between n1.5jlog nand n2 ,...
متن کاملOutput-Sensitive Hidden Surface EIimination for Rectangles
We present an algorithm for the well-known hidden-surface eIimination problem for rectangles, which is a b known as the window rendering problem. The time complexity of our algorithm is sensitive to the size of the output. Specifically, it runs in time that is O(n1mS + k), where k is the size of the output (which can be as large as 0(n’)). For values of k in the range between n’s6/ log n and n2...
متن کامل