Visibility Driven Rasterization

نویسندگان

  • Michael Meißner
  • Dirk Bartz
  • R. Günther
  • Wolfgang Straßer
چکیده

We present a new visibility driven rasterization scheme that significantly increases the rendering performance of modern graphic subsystems. Instead of rasterizing, texturing, lighting, and depth-testing each individual pixel, we introduce a two-level visibility mask within the rasterization stage which facilitates the removal of groups of pixels and triangles from rasterization and subsequent pipeline stages. Local visibility information is stored within the visibility mask that is updated several times during the generation of a frame. The update can easily be accomplished by extending already available (in hardware) occlusion culling mechanisms (i.e. those of HP and SGI), where it is possible to integrate the additional functionality without any additional delay cycles. In addition to these existing hardware based occlusion culling approaches—which cull only geometry contained in bounding volumes determined as occluded—we are able to significantly accelerate the rendering of the geometry determined as visible. However, our approach does not specifically rely on such occlusion culling hardware. The proposed new rasterization scheme is well suited for hardware implementation, can easily be integrated into low-cost rasterizers, and its scalability can vary upon available chip real estate. Only incremental modifications of modern graphics subsystems are required to achieve a significant improvement in rendering performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visibility Driven Rasterization

Cotton-picker dataset containing 10 million triangles. Occlusion culling in z-buffer systems has drawn a lot of attention over the last few years.1,3 Due to the high computational costs of occlusion queries, hardware support is required to accelerate interactive rendering. This requires mechanisms that fit nicely into an available graphics subsystem without greedily consuming chip real estate (...

متن کامل

Visibility Culling per Cache Block with Tiling-Traversal Algorithm

As many applications in computer graphics require render high complex 3D scenes at interactive rates, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we proposed a new rasterization pipeline with visibility culling; the proposed architecture performs the visibility culling ...

متن کامل

A Fast Scanline Micro-Rasterization Kernel and its Application to Soft Shadows

Many soft shadow algorithms approximate the visibility integral via sampling occlusion at many locations on the light source. We present a fast micro-rasterization kernel to efficiently handle a grid of such sample locations by micro-rasterizing triangular occluders onto planar lights. Our bit-parallel scanline algorithm iterates over relevant scanlines and clears occluded samples using a small...

متن کامل

A Voxel-based Rendering Pipeline for Large 3D Line Sets

We present a voxel-based rendering pipeline for large 3D line sets that employs GPU ray-casting to achieve scalable rendering including transparency and global illumination effects that cannot be achieved with GPU rasterization. Even for opaque lines we demonstrate superior rendering performance compared to GPU rasterization of lines, and when transparency is used we can interactively render la...

متن کامل

Sampled and Analytic Rasterization

Hidden surfaces eliminated Sorting To enable visibility prefiltering, the visible parts of the projected scene primitives have to be determined exactly. We employ parallel hidden surface elimination for this task. The computations can be executed in parallel for all edges of the input triangles. This provides sufficient data parallelism to effectively use massively parallel hardware such as GPU...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2001