Files in this item
Raymarching distance fields with CUDA
Item metadata
dc.contributor.author | Hadji-Kyriacou, Avelina | |
dc.contributor.author | Arandelovic, Oggie | |
dc.date.accessioned | 2021-11-09T10:30:10Z | |
dc.date.available | 2021-11-09T10:30:10Z | |
dc.date.issued | 2021-11-09 | |
dc.identifier | 276520185 | |
dc.identifier | fb2bb634-76f7-4f79-80e6-850e32668a7c | |
dc.identifier | 85118694912 | |
dc.identifier | 000724239000001 | |
dc.identifier.citation | Hadji-Kyriacou , A & Arandelovic , O 2021 , ' Raymarching distance fields with CUDA ' , Electronics , vol. 10 , no. 22 , 2730 . https://doi.org/10.3390/electronics10222730 | en |
dc.identifier.issn | 2079-9292 | |
dc.identifier.uri | https://hdl.handle.net/10023/24295 | |
dc.description.abstract | Raymarching is a technique for rendering implicit surfaces using signed distance fields. It has been known and used since the 1980s for rendering fractals and CSG (constructive solid geometry) surfaces, but has rarely been used for commercial rendering applications such as film and 3D games. Raymarching was first used for photorealistic rendering in the mid 2000s by demoscene developers and hobbyist graphics programmers, receiving little to no attention from the academic community and professional graphics engineers. In the present work, we explain why the use of Simple and Fast Multimedia Library (SFML) by nearly all existing approaches leads to a number of inefficiencies, and hence set out to develop a CUDA oriented approach instead. We next show that the usual data handling pipeline leads to further unnecessary data flow overheads and therefore propose a novel pipeline structure that eliminates much of redundancy in the manner in which data are processed and passed. We proceed to introduce a series of data structures which were designed with the specific aim of exploiting the pipeline’s strengths in terms of efficiency while achieving a high degree of photorealism, as well as the accompanying models and optimizations that ultimately result in an engine which is capable of photorealistic and real-time rendering on complex scenes and arbitrary objects. Lastly, the effectiveness of our framework is demonstrated in a series of experiments which compare our engine both in terms of visual fidelity and computational efficiency with the leading commercial and open source solutions, namely Unreal Engine and Blender. | |
dc.format.extent | 26 | |
dc.format.extent | 19043893 | |
dc.language.iso | eng | |
dc.relation.ispartof | Electronics | en |
dc.subject | Rendering | en |
dc.subject | Sphere tracing | en |
dc.subject | Ray tracing | en |
dc.subject | Graphics | en |
dc.subject | Photorealism | en |
dc.subject | CUDA kernels | en |
dc.subject | Acceleration | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | TK Electrical engineering. Electronics Nuclear engineering | en |
dc.subject | NDAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | TK | en |
dc.title | Raymarching distance fields with CUDA | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | 10.3390/electronics10222730 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://www.mdpi.com/2079-9292/10/22/2730 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.