A Theoretical and Empirical Analysis of Coherent Ray-Tracing

Speer, L. Richard; DeRose, Tony; Barsky, Brian A.

doi:10.1007/978-4-431-68033-8_2

Cited by 18 publications

(7 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Their analysis deals with scanline algorithms; however, they address ray tracing too and state that the resolution of the image has a great influence on the obtained speedup. A similar result has been obtained by Speer et al in [23] with theoretical and empirical means. They say, that although similarity can be found between ray histories of adjacent pixels, it seems difficult to exploit this in an algorithm.…”

Section: Coherencesupporting

confidence: 88%

Fast ray tracing of sequences by ray history evaluation

Formella

Gill²,

Hofmeyer³

Proceedings of Computer Animation '94

View full text Add to dashboard Cite

W e present a method t o reduce the tame needed t o render a sequence of ray traced zmages. W e exploit the temporal an,d spataal coherence between consecutive frames. The algorithm does not only inspect the am,-age plane in order t o find regions with minor changes; the object space is analysed by evaluating the so called ray history. With this method we obtain a speedup zn the range of 1.2 t o 2.8 almost without visible loss of quality. The method is more or less independent of the used ray trace algorithm and can be implemented zn many ray trace programs without too mvch efort.

show abstract

Section: Coherencesupporting

confidence: 88%

Fast ray tracing of sequences by ray history evaluation

Formella

Gill²,

Hofmeyer³

Proceedings of Computer Animation '94

View full text Add to dashboard Cite

show abstract

“…To accelerate the process, various space partitioning methods such as angular sectoring [6], kD-tree, octree, quad tree [11][12][13] and a preprocessing method are proposed [14]. In computer graphics field also, acceleration techniques for the visibility test have been studied, in which the concept of ray frustums [15] was introduced to accelerate the visibility tests in generating graphic images, and the concept is applied to radio [16] and sound wave [17] propagations.…”

Section: Introductionmentioning

confidence: 99%

Accelerated Three Dimensional Ray Tracing Techniques Using Ray Frustums for Wireless Propagation Models

Kim¹,

Lee²

2009

PIER

View full text Add to dashboard Cite

Abstract-In this paper, accelerated techniques for three dimensional ray tracing using the concept of ray frustums are presented for the fast characterization of wireless communications, where various radio propagation paths such as wall-transmitted wave and scattered wave from buildings and ground are generated. To accommodate such scatterers, objects are modeled by triangulated meshes, and potential ray paths are searched and stored in the form of ray frustums. The presented acceleration techniques using the frustums include sorting of triangulated surfaces, hashing functions and space partitioning. The validity of the method is verified by comparison with measurement data.

show abstract

“…During parallel BSP traversal different rays may traverse along the same BSP tree path ("ray coherence [15]") or along different BSP tree paths ("ray incoherence"). The coherence case is easily handled in a SIMD architecture.…”

Section: : Simd Bsp Traversalmentioning

confidence: 99%

“…BSP recursively partitions a 3D cube into 2 sub-cubes, defined as left and right children. BSP works like a Binary -Search Tree [15]. When one ray intersects with one cube, it tests whether it intersects with only left, right, or both children.…”

Section: : Simd Bsp Traversalmentioning

confidence: 99%

Interactive ray tracing on reconfigurable SIMD morphosys

Du¹,

Sánchez-Élez²,

Tabrizi³

et al.

2003 Design, Automation and Test in Europe Conference and Exhibition

View full text Add to dashboard Cite

MorphoSys is a reconfigurable SIMD architecture. In this paper, a BSP-based ray tracing is gracefully mapped onto MorphoSys. The mapping highly exploits ray-tracing parallelism. A straightforward mechanism is used to handle irregularity among parallel rays in BSP. To support this mechanism, a special data structure is established, in which no intermediate data has to be saved. Moreover, optimizations such as object reordering and merging are facilitated. Data starvation is avoided by overlapping data transfer with intensive computation so that applications with different complexity can be managed efficiently. Since MorphoSys is small in size and power efficient, we demonstrate that MorphoSys is an economic platform for 3D animation applications on portable devices. 1: IntroductionMorphoSys [1] is a reconfigurable SIMD processor targeted at portable devices, such as Cellular phone and PDAs. It combines coarse grain reconfigurable hardware with one general-purpose processor. Applications with a heterogeneous nature and different sub-tasks, such as MPEG, DVB-T, and CDMA, can be efficiently implemented on it. In this paper a 3D graphics algorithm, ray tracing, is mapped onto MorphoSys to achieve realistic illumination. We show that SIMD ray-tracing on MorphoSys is more efficient in power consumption and has a lower hardware cost than both multiprocessors and the single CPU approaches.Ray tracing [2] is a global illumination model. It is well known for its highly computation characteristic due to its recursive behavioral. Recent fast advancement of VLSI technology has helped achieving interactive ray tracing on a multiprocessor [3] and a cluster system [9,10] for large scenes, and on a single PC with SIMD extensions [4] for small scenes. In [3], Parker achieves 15 frames/second for a 512x512 image by running ray tracing on a 60-node (MIPS R12000) SGI origin 2000 system. Each node has a clock faster than 250MHz, 64-bit data paths, floating-point units, 64K L1 cache, 8MB L2 cache, and at least 64MB main memory. Muuss [9,10] worked on parallel and distributed ray tracing for over a decade. By using a cluster of SGI Power Challenge machines [10], a similar performance as Parker's is reached. Their work is different in their task granularity, load balancing and synchronization mechanisms. The disadvantage of their work is that there are extra costs such as high clock frequency, floating-point support, large memory bandwidth, efficient communication and scheduling mechanisms. Usually, the sub-division structure (such as BSP tree-Binary Space Partitioning [7,8]) is replicated in each processor during traversal. As will be seen, only one copy is saved in our implementation.Wald [4] used a single PC (Dual Pentium-III, 800Mhz, 256 MB) to render images of 512x512, and got 3.6 frames/second. 4-way Ray coherence is exploited by using SIMD instructions. The hardware support for floating-point, as well as the advanced branch prediction and speculation mechanisms helps speed up ray tracing. The ray incoherence is handled using a sche...

show abstract

A Theoretical and Empirical Analysis of Coherent Ray-Tracing

Cited by 18 publications

References 11 publications

Fast ray tracing of sequences by ray history evaluation

Fast ray tracing of sequences by ray history evaluation

Accelerated Three Dimensional Ray Tracing Techniques Using Ray Frustums for Wireless Propagation Models

Interactive ray tracing on reconfigurable SIMD morphosys

Contact Info

Product

Resources

About