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 GPUs. The main stages of our analytic visibility method are described below.
منابع مشابه
Wavelet Rasterization
We present a method for analytically calculating an anti-aliased rasterization of arbitrary polygons or fonts bounded by Bézier curves in 2D as well as oriented triangle meshes in 3D. Our algorithm rasterizes multiple resolutions simultaneously using a hierarchical wavelet representation and is robust to degenerate inputs. We show that using the simplest wavelet, the Haar basis, is equivalent t...
متن کاملNon-Sampled Anti-Aliasing
In this paper we present a parallel method for high-quality edge anti-aliasing in rasterization. In contrast to traditional graphics hardware methods, which rely on massive oversampling to combat aliasing issues, we evaluate a closed-form solution of the associated prefilter convolution. This enables the use of a wide range of filter functions with arbitrary kernel sizes, as well as general sha...
متن کامل3D rasterization: a bridge between rasterization and ray casting
Ray tracing and rasterization have long been considered as two fundamentally different approaches to rendering images of 3D scenes, although they compute the same results for primary rays. Rasterization projects every triangle onto the image plane and enumerates all covered pixels in 2D, while ray tracing operates in 3D by generating rays through every pixel and then finding the closest interse...
متن کامل3D Rasterization – Unifying Rasterization and Ray Casting
Ray tracing and rasterization have long been considered as two very different approaches to rendering images of 3D scenes that – while computing the same results for primary rays – lie at opposite ends of a spectrum. While rasterization first projects every triangle onto the image plane and enumerates all covered pixels in 2D, ray tracing operates in 3D by generating rays through every pixel an...
متن کاملSupercover plane rasterization - a rasterization algorithm for generating supercover plane inside a cube
An analysis of a rasterization algorithm for generating supercover planes in 3D voxel space is presented. The derived algorithm is an extension to the classical 2D line rasterization algorithm. Additional voxels needed to form the supercover 3D plane are identified by rasterizing two additional 2D lines per volume slice. A discussion on how to modify the algorithm to rasterize finite supercover...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013