Journal Article10.1007/BF01901944
An efficient hierarchical-traversal algorithm for ray tracing
4
TL;DR: A new hierarchy traversal scheme is described to reduce the number of raybounding volume intersection tests for secondary rays and a plane-sweep method is proposed to make fewer intersection checks for eye rays.
read more
Abstract: Ray tracing has been shown to be an excellent technique for rendering realistic images. However, it is important to reduce the lengthy computation time resulting from the brute-force nature of the original ray-tracing algorithms. In this paper, two ideas are proposed to speep up the well-known hierarchical subdivision method. First, a new hierarchy traversal scheme is described to reduce the number of raybounding volume intersection tests for secondary rays. Then, a plane-sweep method is proposed to make fewer intersection checks for eye rays. Experiments and discussions are presented to prove the feasibility of our methods.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Sorting and Searching in Rendering Algorithms
Vlastimil Havran,Jiri Bittner +1 more
- 01 Jan 2014
TL;DR: This tutorial provides both theoretical and empirical evidence that for many rendering techniques most time is spent by sorting and searching, and discusses problems and solutions for visibility computation, density estimation, and importance sampling.
21
Convex object based volume visualization: a formal proof and example
TL;DR: A new subdivision strategy is suggested, the convex object based subdivision scheme, which can be more efficient in generating the conveX objects for ordered visualization.
2
Parallel algorithm for image rendering and its implementation
TL;DR: The authors present a parallel algorithm for fast rendering that renders zones of a set of zones which can be concurrently processed by a number of processors equal to the number of available processors.
2
Ray tracing with reduced-precision bounding volume hierarchies
Jeffrey Mahovsky
- 01 Jan 2005
TL;DR: A reduced-precision, hierarchical, integer representation for the BVH's AABB coordinates is investigated, and integer tests are shown to reduce the circuit size and complexity of a hardware ray-AABB test by roughly half.
References
•Book
An improved illumination model for shaded display
Turner Whitted
- 01 Dec 1988
TL;DR: In this article, a tree of "rays" extending from the viewer to the first surface encountered and from there to other surfaces and to the light sources is used to calculate the intensity of the light received by the viewer.
1.9K
An improved illumination model for shaded display
TL;DR: Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction, as well as the effects simulated by conventional shaders.
Space subdivision for fast ray tracing
TL;DR: In this article, an octree-based algorithm is proposed to reduce the number of time-consuming object-ray intersection calculations by associating a given voxel with only those objects whose surfaces pass through the volume of the Voxel, which makes possible the ray tracing of complex scenes by medium-scale and small-scale computers.
677
Some techniques for shading machine renderings of solids
Arthur Appel
- 30 Apr 1968
TL;DR: If techniques for the automatic determination of chiaroscuro with good resolution should prove to be competitive with line drawings, and this is a possibility, machine generated photographs might replace line drawings as the principal mode of graphical communication in engineering and architecture.
615
Ray tracing complex scenes
Timothy L. Kay,James T. Kajiya +1 more
- 31 Aug 1986
TL;DR: A new algorithm for speeding up ray-object intersection calculations is presented and a new hierarchy traversal algorithm is presented which is efficient in the sense that objects along the ray are queried in an efficient order.
584