Results 1  10
of
25
Distribution ray tracing: Theory and practice
 In Proceedings of the Third Eurographics Workshop on Rendering
, 1992
"... Distribution ray tracing uses Monte Carlo integration to solve the rendering equation. This technique was introduced by Cook et. al, and was notable because of its simplicity and its ability to simulate areal luminaires, camera lens e ects, motion blur, and imperfect specular re ection[5]. Distribut ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
Distribution ray tracing uses Monte Carlo integration to solve the rendering equation. This technique was introduced by Cook et. al, and was notable because of its simplicity and its ability to simulate areal luminaires, camera lens e ects, motion blur, and imperfect specular re ection[5]. Distribution
Hybrid Scene Structuring with Application to Ray Tracing
 In Proc. of ICVC
, 1999
"... The handling of highly complex 3D scenes is one of the major challenges in computer graphics. Several data structures were proposed in the past to address this problem. Many of these schemes are only suited for specific spatial distribution of objects in 3D space, making it difficult for a developer ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
The handling of highly complex 3D scenes is one of the major challenges in computer graphics. Several data structures were proposed in the past to address this problem. Many of these schemes are only suited for specific spatial distribution of objects in 3D space, making it difficult for a developer to select the appropriate data structure for the scene and/or application. Further, the selection of initialization parameters is typically a nontrivial task. Using a ray casting environment this paper presents an algorithm that automatically builds a hybrid data structure combining bounding volume hierarchies and uniform spatial subdivisions for a given scene. Our data structure is built by first creating a cost function based volume hierarchy, subsequently detecting regions of uniformly distributed objects using the scene hierarchy, and, as the last step, locally integrating uniform spatial subdivisions into the scene tree. We will show that the data structure can be built with low costs, both with regard to space and to runtime. Finally, we present rendering times that demonstrate the usefulness of the new approach compared to standard techniques by comparing runtime efficiency. The memory requirements of the new data structure are, on average, linear in the number of scene objects. Further applications of the hybrid approach are also proposed. Key Words: spatial subdivision, geometry structuring, bounding volume hierarchies, photorealistic rendering, graphics architecture. 1.
Ray Tracing with Rope Trees
 in Proceedings of 13th Spring Conference On Computer Graphics, Budmerice in Slovakia
, 1998
"... In this paper an acceleration method for finding the nearest rayobject intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the te ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
In this paper an acceleration method for finding the nearest rayobject intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the technique based on BSP tree and uniform spatial subdivision. Key words: spatial subdivision, BSP tree, spatial data structures, rope trees, ray tracing. 1 Introduction Ray tracing is a wellknown rendering technique for producing realistic images that simulates well specular surfaces. The main drawback of this algorithm is its rather big computational complexity, that disallows its interactive use. The problem has been focused a great deal of research interest in the past leading to some practical techniques to accelerate the basic algorithm. The principal expense of ray tracing is the determination of the closest rayobject intersection for a given ray and a set of objects. This problem i...
SelfCustomized BSP Trees for Collision Detection
, 2000
"... The ability to perform efficient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we reexplore a classical structure used for collision detection  the binary space partitioning tree. Unlike the common approach, which a ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
The ability to perform efficient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we reexplore a classical structure used for collision detection  the binary space partitioning tree. Unlike the common approach, which attributes equal likelihood to each possible query, we assume events that happened in the past are more likely to happen again in the future. This leads us to the definition of selfcustomized data structures. We report encouraging results obtained while experimenting with this concept in the context of selfcustomized bsp trees. Keywords: Collision detection, binary space partitioning, selfcustomization. 1 Introduction Virtual reality refers to the use of computer graphics to simulate physical worlds or to generate synthetic ones, where a user is to feel immersed in the environment to the extent that the user feels as if "objects" seen are really there. For example, "objects" should m...
LCTS: Ray Shooting using Longest Common Traversal Sequences
 Computer Graphics Forum
, 2000
"... We describe two new techniques of ray shooting acceleration that exploit the traversal coherence of a spatial hierarchy. The first technique determines a sequence of adjacent leafcells of the hierarchy that is pierced by all rays contained within a certain convex shaft. This sequence is used to ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We describe two new techniques of ray shooting acceleration that exploit the traversal coherence of a spatial hierarchy. The first technique determines a sequence of adjacent leafcells of the hierarchy that is pierced by all rays contained within a certain convex shaft. This sequence is used to accelerate ray shooting for all remaining rays within the shaft. The second technique establishes a cut of the hierarchy that contains nodes where the hierarchy traversal can no longer be predetermined for all rays contained within a given shaft. This cut is used to initiate the traversal for all remaining rays contained in the shaft. The description of the methods is followed by results evaluated by their practical implementation. Keywords: ray shooting, ray casting, BSP tree, traversal coherence, hidden surface removal. 1.
A Simple and Practical Method for Interactive Ray Tracing of Dynamic Scenes
, 2002
"... Recently developed interactive ray tracing systems combine the highperformance of todays CPUs with new algorithms and implementations to achieve a flexible and highperformance rendering system offering highquality, interactive 3D graphics. However, due to its history in offline rendering, interac ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Recently developed interactive ray tracing systems combine the highperformance of todays CPUs with new algorithms and implementations to achieve a flexible and highperformance rendering system offering highquality, interactive 3D graphics. However, due to its history in offline rendering, interactive ray tracing has been limited to static scenes and simple walkthroughs. However, in order to become truly interactive ray tracing must support dynamic scenes efficiently.
Ray Tracing with the BSP Tree
"... One of the most fundamental concepts in computer graphics is binary space subdivision. In its purest form, this concept leads to binary space partitioning trees (BSP trees) with arbitrarily oriented space partitioning planes. In practice, however, most algorithms use kdtrees—a special case of BSP t ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
One of the most fundamental concepts in computer graphics is binary space subdivision. In its purest form, this concept leads to binary space partitioning trees (BSP trees) with arbitrarily oriented space partitioning planes. In practice, however, most algorithms use kdtrees—a special case of BSP trees that restrict themselves to axisaligned planes—since BSP trees are believed to be numerically unstable, costly to traverse, and intractable to build well. In this paper, we show that this is not true. Furthermore, after optimizing our general BSP traversal to also have a fast kdtree style traversal path for axisaligned splitting planes, we show it is indeed possible to build a general BSP based ray tracer that is highly competitive with state of the art BVH and kdtree based systems. We demonstrate our ray tracer on a variety of scenes, and show that it is always competitive with—and often superior to—state of the art BVH and kdtree based ray tracers.
A study of restricted bsp trees for ray tracing
 In Interactive Ray Tracing, 2007. RT ’07. IEEE Symposium on, number 2
, 2007
"... The Restricted Binary Space Partitioning Tree (RBSP Tree) is introduced as an acceleration structure for ray tracing. An RBSP tree is a Binary Space Partitioning tree in which the splitting planes are restricted to a set of planes determined prior to tree construction. The RBSP tree, with its abilit ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Restricted Binary Space Partitioning Tree (RBSP Tree) is introduced as an acceleration structure for ray tracing. An RBSP tree is a Binary Space Partitioning tree in which the splitting planes are restricted to a set of planes determined prior to tree construction. The RBSP tree, with its ability to select the splitting plane from a set of several planes, forms a structure that wraps the object closely resulting in a reduction in the number of intersections and node traversals. We study the theoretical utility of such a structure for ray tracing.
Speeding Up Ray Tracing  SW and HW approaches
, 1995
"... The short overview of several acceleration techniques for ray tracing algorithm is presented. The aim of this paper is to show how combination of both software improvements and hardware support can help to achieve higher speed of rendering. Such simple but memory and time consuming algorithm like ra ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The short overview of several acceleration techniques for ray tracing algorithm is presented. The aim of this paper is to show how combination of both software improvements and hardware support can help to achieve higher speed of rendering. Such simple but memory and time consuming algorithm like ray tracing is an ideal case for understanding of typical speeding up methods used in three dimensional computer graphics. Most of presented approaches thus have more general validity. Keywords computer graphics, rendering, ray tracing, speeding up, parallel algorithm. 1 Introduction The ray tracing algorithm is one of the most popular methods in computer graphics and probably everybody at least partially experienced in 3D graphics knows it. The simplicity of a ray tracing (its basic version respectively) has attracted many people to implement it with the highest possible efficiency. But still no realtime ray tracer is known to author, although research papers on software improvements a...
Density Estimation Optimizations for Global Illumination
 Montes WSCG’2006  Short Communications Proceedings. ISBN
, 2006
"... Density estimation on the tangent plane (DETP) is a density estimation technique for global illumination. This technique is based on Photon Maps and provides increased accuracy when the surfaces are not locally smooth or continuous. However, the performance of the technique is limited by the large n ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Density estimation on the tangent plane (DETP) is a density estimation technique for global illumination. This technique is based on Photon Maps and provides increased accuracy when the surfaces are not locally smooth or continuous. However, the performance of the technique is limited by the large number of raydisc intersections needed. Some optimizations which increase the performance of DETP have been devised. The first optimization works by creating a set of candidate rays for each radiance calculation. The second optimization uses spatial indexing of the discs around the radiance calculation points. An analytical study of the order of complexity of the algorithms, as well as an heuristic study of the calculation time for the different values of the parameters involved, has been performed. Some rules are given in order to identify the most suitable optimization for a given radiance calculation.