Exact regional visibility using line space partitioning
نویسندگان
چکیده
منابع مشابه
OpenGL-assisted Visibility Queries of Large Polygonal Models
We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of OpenGL-assisted frustum culling, hierarchical model-space partitioning, and OpenGL based occlusion culling, we achieve a significant better performance on general polygonal models than previous approaches. In contrast to these approaches, we only expl...
متن کاملHierarchical Techniques for Visibility Computations
Visibility computation is crucial for computer graphics from its very beginning. The first visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a 3D scene. Nowadays there is a plethora of visibility algorithms for various applications. The thesis proposes a taxonomy of visibility problems based on the dimension of the problem-relevant line set, i.e. set o...
متن کاملConservative Visibility Preprocessing for Complex Virtual Environments
This paper presents a new approach to visibility culling. We propose a conservative visibility preprocessing method for complex virtual environments. The proposed method deals with general 3D graphical models and invisible polygons jointly blocked by multiple occluders. The proposed method decomposes volume visibility from the predefined volume into the area visibility from rectangles surroundi...
متن کاملCoherent and Exact Polygon-to-Polygon Visibility
Visibility computation is a classical problem in computer graphics. A wide variety of algorithms provides solutions with a different accuracy. However, the four dimensional nature of the 3D visibility has prevented for a long time from leading to exact from-polygon visibility algorithms. Recently, the two first tractable solutions were presented by Nirenstein, then Bittner. Their works give the...
متن کاملConservative Visibility Determination for Architectural Scenes
In this article I present a conservative visibility determination algorithm, particularly suited for interactive walkthroughs in architectural scenes. This algorithm is able to determine which parts of the scene are visible during an interactive real-time walkthrough. The algorithm consists of an off-line part, which preprocesses the scene, and an on-line part, which determines the potentially ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Graphics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003