Ray Tracing Polygons using Spatial Subdivision
نویسنده
چکیده
Ray tracing [Appe68] [Gold71] is widely acknowledged as a rendering approach that can produce very realistic and beautiful images [Whit80]. It is also widely known that ray tracing is very expensive computationally. Many intersection culling algorithms have been proposed to reduce this expense. However, such intersection culling algorithms do not take into consideration the nature of the primitives which they are culling.
منابع مشابه
Adaptive Voxel Subdivision for Ray Tracing
Although regular subdivision has been shown to be efficient at ray tracing scenes where objects are evenly distributed, such algorithms perform poorly when objects are concentrated in a small number of voxels. In this paper, a method is presented where voxels in a regular grid are examined and recursively subdivided depending on object density. This integration of regular and adaptive spatial s...
متن کاملCost Prediction in Ray Tracing
Although it is generally known that ray tracing is ’time consuming’, yet rewarding with respect to image quality, there are few attempts to predict the rendering time for a given model in advance. This paper focusses on the development of such a technique. The cost of ray tracing using adaptive spatial subdivisions has been studied by analysing the probability that a ray intersects an object. P...
متن کاملVisibility as an Intrinsic Property of Geometric Models
This paper presents a technique to improves the performance of algorithms that exploits visibility based analysis in computer graphics, such as ray tracing. The presented approach maintains a list of visible polygons for each and every one of the polygons in the model as well as for, optionally, the light sources in the scene. A pre-processing visibility analysis stage that is view-independent ...
متن کاملRay Tracing Triangular Trimmed Free Form Surfaces
This paper presents a new approach to rendering triangular algebraic free form surfaces. A hierarchical subdivision of the surface with associated tight bounding volumes provides for quick identification of the surface regions likely to be hit by a ray. For each leaf of the hierarchy an approximation to the corresponding surface region is stored. The approximation is used to compute a good star...
متن کاملAn Efficient Parallel Spatial Subdivision Algorithm for Object-Based Parallel Ray Tracing
Parallel ray tracing of complex scenes on multicomputers requires distribution of both computations and scene data to the processors. This is carried out during preprocessing and usually consumes too much time and memory. In this paper, we present an efficient parallel subdivision algorithm to decompose a given scene into rectangular regions adaptively and map the resultant regions to the node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992