A simple output-sensitive algorithm for hidden surface removal
نویسندگان
چکیده
منابع مشابه
Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra
In this paper we present an output-sensitive algorithm to maintain the view of a set of c-oriented polyhedra under insertions into or deletions from the set. (A set of polyhedra is c-oriented ifthe number of different orientations of its edges is bounded by some constant c.) Cyclic overlap in the scene is aJlowed and the polyhedra may even intersect. The time needed for an update is 0« k + 1) l...
متن کاملOutput-Sensitive Methods for Rectilinear Hidden Surface Removal
Mark H. Overmars§ We present an algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering. The time complexity of OUI algorithm is dependent on both the number of input rectangles, n, and on the size of the output, k. Our algorithm obtains a hade-off between these two components, in that its running time is O(r(nI+l/T" + k», where 1 5 r :S log ...
متن کامل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...
متن کامل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...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 1992
ISSN: 0730-0301,1557-7368
DOI: 10.1145/102377.112141