Results 1  10
of
29
Hierarchical Zbuffer visibility
 In Computer Graphics (SIGGRAPH ’93 Proceedings
, 1993
"... An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generated. Ray casting with spatial subdivision does well on criterion (a), but poorly on criterion (b). Traditional Zbuffer sc ..."
Abstract

Cited by 245 (1 self)
 Add to MetaCart
(Show Context)
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generated. Ray casting with spatial subdivision does well on criterion (a), but poorly on criterion (b). Traditional Zbuffer scan conversion does well on criterion (b), but poorly on criterion (a). Here we present a hierarchical Zbuffer scanconversion algorithm that does well on both criteria. The method uses two hierarchical data structures, an objectspace octree and an imagespace Z pyramid, to accelerate scan conversion. The two hierarchical data structures make it possible to reject hidden geometry very rapidly while rendering visible geometry with the speed of scan conversion. For animation, the algorithm is also able to exploit temporal coherence. The method is well suited to models with high depth complexity, achieving orders of magnitude acceleration in some cases compared to ordinary Zbuffer scan conversion.
Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies
 ACM Transactions on Graphics
, 2006
"... The most significant deficiency of most of today’s interactive ray tracers is that they are restricted to static walkthroughs. This restriction is due to the static nature of the acceleration structures used. While the best reported frame rates for static geometric models have been achieved using ca ..."
Abstract

Cited by 89 (18 self)
 Add to MetaCart
The most significant deficiency of most of today’s interactive ray tracers is that they are restricted to static walkthroughs. This restriction is due to the static nature of the acceleration structures used. While the best reported frame rates for static geometric models have been achieved using carefully constructed kdtrees, this article shows that bounding volume hierarchies (BVHs) can be used to efficiently ray trace large static models. More importantly, the BVH can be used to ray trace deformable models (sets of triangles whose positions change over time) with little loss of performance. A variety of efficiency techniques are used to achieve this performance, but three algorithmic changes to the typical BVH algorithm are mainly responsible. First, the BVH is built using a variant of the surface area heuristic conventionally used to build kdtrees. Second, the topology of the BVH is not changed over time so that only the bounding volumes need to be refit from frametoframe. Third, and most importantly, packets of rays are traced together through the BVH using a novel integrated packetfrustum traversal scheme. This traversal scheme elegantly combines the advantages of both packet traversal and frustum traversal and allows for rapid hierarchy descent for packets that hit bounding volumes as well as rapid exits for packets that miss. A BVHbased ray tracing system using these techniques is shown to achieve performance for deformable models comparable to that previously available only for static models.
Applying space subdivision techniques to volume rendering
 In Proceedings of Visualization ’90, 150–159
, 1990
"... ..."
(Show Context)
Implementing ray tracing with octrees and neighbor finding
 Computers And Graphics
, 1989
"... AbstractA ray tracing implementation is described that is based on an octree representation of a scene. Rays are traced through the scene by calculating the blocks through which they pass. This calculation is performed in a bottomup manner through the use of neighbor finding. The octrees are assu ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
(Show Context)
AbstractA ray tracing implementation is described that is based on an octree representation of a scene. Rays are traced through the scene by calculating the blocks through which they pass. This calculation is performed in a bottomup manner through the use of neighbor finding. The octrees are assumed to be implemented by a pointer representation. The most basic operation in computer graphics is the conversion of an internal model of a threedimensional scene into a twodimensional scene that lies on the viewplane. The purpose is to generate an image of the
Geometric and Arithmetic Culling Methods for Entire Ray Packets
, 2006
"... Recent interactive ray tracing performance has been mainly derived from the use of ray packets. Larger ray packets allow for significant amortization of both computations and memory accesses; however, the majority of primitives are still intersected by each ray in a packet. This paper discusses seve ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
(Show Context)
Recent interactive ray tracing performance has been mainly derived from the use of ray packets. Larger ray packets allow for significant amortization of both computations and memory accesses; however, the majority of primitives are still intersected by each ray in a packet. This paper discusses several methods to cull entire ray packets against common primitives (box, triangle, and sphere) that allows an arbitrary number of rays to be tested by a single test. This provides cheap “all miss ” or “all hit ” tests and may substantially improve the performance of an interactive ray tracer. The paper surveys current methods, provides details on three particular approaches using interval arithmetic, bounding planes, and corner rays, describes how the respective bounding primitives can be easily and efficiently constructed, and points out the relation among the different fundamental concepts.
Fast Ray Tracing Using KD Trees
, 1988
"... A hierarchical search structure for ray tracing based on kd trees is introduced. This data ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
A hierarchical search structure for ray tracing based on kd trees is introduced. This data
Cost Prediction for Ray Shooting
 PROC. OF EIGHTEENTH ACM SYMP. ON GEOM. COMPUT.
, 2002
"... The ray shooting problem arises in many different contexts. For example, solving it efficiently would ... ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The ray shooting problem arises in many different contexts. For example, solving it efficiently would ...
Early split clipping for bounding volume hierarchies
 IN PROCEEDINGS OF THE 2007 IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING
, 2007
"... Despite their algorithmic elegance and robustness, bounding volume hierarchies (BVHs) have not reached the performance of kdtrees for ray tracing. BVHs do not adapt well to scenes containing large triangles with overlapping bounding boxes. A node cannot be smaller than the bounding box of the primit ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Despite their algorithmic elegance and robustness, bounding volume hierarchies (BVHs) have not reached the performance of kdtrees for ray tracing. BVHs do not adapt well to scenes containing large triangles with overlapping bounding boxes. A node cannot be smaller than the bounding box of the primitives it contains. Consequently, the leafs and internal nodes will overlap substantially. This slows down ray tracing, because the number of traversal steps and rayprimitive intersections is increased. Unfortunately, this kind of geometry is common in architectural scenes and lowpoly CAD models. In this paper, we present a building algorithm for BVHs that handles such scenes more efficiently. The restriction that each primitive must be contained in exactly one leaf node is relaxed. Bounding boxes of large primitives are refined with recursive split clipping before constructing the hierarchy. The resulting volumes are used as input for a regular BVH building algorithm. Neither scene geometry nor traversal or building algorithms must be modified in any way. The resulting hierarchies are superior for a wide range of data sets, leading to speedups of more than a factor of three.
Ray Tracing: A Quantitative Analysis and a New Practical Algorithm
 The Visual Computer
, 1995
"... We present a new method to accelerate the process of finding nearest rayobject intersections in ray tracing. The algorithm consumes an amount of memory more or less linear in the number of objects. The basic ideas can be characterized with a modified BSPtree and plane traversal. Plane traversal ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
(Show Context)
We present a new method to accelerate the process of finding nearest rayobject intersections in ray tracing. The algorithm consumes an amount of memory more or less linear in the number of objects. The basic ideas can be characterized with a modified BSPtree and plane traversal. Plane traversal is a fast linear time algorithm to find the closest intersection point in a list of bounding volumes hit by a ray. We use plane traversal at every node of the high outdegree BSPtree. Our implementation is competitive to fast ray tracing programs. We present a benchmark suite which allows for an extensive comparison of ray tracing algorithms. Keywords: ray tracing, space subdivision, plane traversal, octree, clustering, benchmark scenes 1 Introduction Ray tracing, the well known rendering technique which produces high quality images, simulates geometric optics by tracing rays of light from a virtual viewpoint into an object space. Realistic images are the result of applying illumination m...