Improving Divide-and-Conquer Ray-Tracing Using a Parallel Approach

This paper presents a new Divide-and-Conquer Ray-Tracing (DACRT) algorithm that is designed to perform on multi-core processors. This new algorithm proposes a parallel and generic scheme that, without the use of any data structure for spatial subdivision, maintains memory management minimal and dete...

Full description

Saved in:
Bibliographic Details
Published in2014 27th SIBGRAPI Conference on Graphics, Patterns and Images pp. 9 - 16
Main Authors De Lara Pahins, Cicero Augusto, Pozzer, Cesar Tadeu
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.08.2014
Subjects
Algorithm design and analysis
Algorithms
Brazil
Cameras
Conferences
Data structures
divide-and-conquer
Frames
Hardware
Interactive
Microprocessors
Optimization
parallelization
Processors
Ray tracing
Vectors
Online AccessGet full text

Cover

More Information
Summary:This paper presents a new Divide-and-Conquer Ray-Tracing (DACRT) algorithm that is designed to perform on multi-core processors. This new algorithm proposes a parallel and generic scheme that, without the use of any data structure for spatial subdivision, maintains memory management minimal and deterministic. Initially, the scene is divided into sub-scenes and those uniformly distributed across available hardware resources, processing each sub-scene individually. After, an iterative step to ensure the correct results is performed until the final frame is obtained. Results show that our algorithm is up to 2.4x times faster than the original DACRT in a common quad-core processor setup, allowing very high interactive frame rates in well-known benchmark scenes.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1530-1834
2377-5416
1530-1834
DOI:10.1109/SIBGRAPI.2014.32