No Cover Image

Journal article 1275 views

Naive ray-tracing: A divide-and-conquer approach

Benjamin Mora Orcid Logo

ACM Transactions on Graphics, Volume: 30, Issue: 5, Start page: 117

Swansea University Author: Benjamin Mora Orcid Logo

Full text not available from this repository: check for access using links below.

Check full text

DOI (Published version): 10.1145/2019627.2019636

Abstract

This paper presents for the first time how to achieve efficient ray-tracing without using a spatial subdivision data structure. Intersections are computed from just a set of rays and a set of triangles, without any processing steps. The approach also demonstrates state-of-the-art performances and de...

Full description

Published in: ACM Transactions on Graphics
ISSN: 0730-0301
Published: ACM 2011
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa7579
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T11:58:45Z
last_indexed 2018-02-09T04:35:55Z
id cronfa7579
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2015-07-08T13:43:08.6364390</datestamp><bib-version>v2</bib-version><id>7579</id><entry>2012-02-23</entry><title>Naive ray-tracing: A divide-and-conquer approach</title><swanseaauthors><author><sid>557f93dfae240600e5bd4398bf203821</sid><ORCID>0000-0002-2945-3519</ORCID><firstname>Benjamin</firstname><surname>Mora</surname><name>Benjamin Mora</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2012-02-23</date><deptcode>SCS</deptcode><abstract>This paper presents for the first time how to achieve efficient ray-tracing without using a spatial subdivision data structure. Intersections are computed from just a set of rays and a set of triangles, without any processing steps. The approach also demonstrates state-of-the-art performances and deterministic memory usage, which is important in some systems like game consoles, and allows real-time ray-tracing.</abstract><type>Journal Article</type><journal>ACM Transactions on Graphics</journal><volume>30</volume><journalNumber>5</journalNumber><paginationStart>117</paginationStart><publisher>ACM</publisher><issnPrint>0730-0301</issnPrint><issnElectronic/><keywords>ray-tracing, rendering</keywords><publishedDay>1</publishedDay><publishedMonth>10</publishedMonth><publishedYear>2011</publishedYear><publishedDate>2011-10-01</publishedDate><doi>10.1145/2019627.2019636</doi><url/><notes></notes><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2015-07-08T13:43:08.6364390</lastEdited><Created>2012-02-23T17:02:01.0000000</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>Benjamin</firstname><surname>Mora</surname><orcid>0000-0002-2945-3519</orcid><order>1</order></author></authors><documents/><OutputDurs/></rfc1807>
spelling 2015-07-08T13:43:08.6364390 v2 7579 2012-02-23 Naive ray-tracing: A divide-and-conquer approach 557f93dfae240600e5bd4398bf203821 0000-0002-2945-3519 Benjamin Mora Benjamin Mora true false 2012-02-23 SCS This paper presents for the first time how to achieve efficient ray-tracing without using a spatial subdivision data structure. Intersections are computed from just a set of rays and a set of triangles, without any processing steps. The approach also demonstrates state-of-the-art performances and deterministic memory usage, which is important in some systems like game consoles, and allows real-time ray-tracing. Journal Article ACM Transactions on Graphics 30 5 117 ACM 0730-0301 ray-tracing, rendering 1 10 2011 2011-10-01 10.1145/2019627.2019636 COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2015-07-08T13:43:08.6364390 2012-02-23T17:02:01.0000000 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science Benjamin Mora 0000-0002-2945-3519 1
title Naive ray-tracing: A divide-and-conquer approach
spellingShingle Naive ray-tracing: A divide-and-conquer approach
Benjamin Mora
title_short Naive ray-tracing: A divide-and-conquer approach
title_full Naive ray-tracing: A divide-and-conquer approach
title_fullStr Naive ray-tracing: A divide-and-conquer approach
title_full_unstemmed Naive ray-tracing: A divide-and-conquer approach
title_sort Naive ray-tracing: A divide-and-conquer approach
author_id_str_mv 557f93dfae240600e5bd4398bf203821
author_id_fullname_str_mv 557f93dfae240600e5bd4398bf203821_***_Benjamin Mora
author Benjamin Mora
author2 Benjamin Mora
format Journal article
container_title ACM Transactions on Graphics
container_volume 30
container_issue 5
container_start_page 117
publishDate 2011
institution Swansea University
issn 0730-0301
doi_str_mv 10.1145/2019627.2019636
publisher ACM
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
document_store_str 0
active_str 0
description This paper presents for the first time how to achieve efficient ray-tracing without using a spatial subdivision data structure. Intersections are computed from just a set of rays and a set of triangles, without any processing steps. The approach also demonstrates state-of-the-art performances and deterministic memory usage, which is important in some systems like game consoles, and allows real-time ray-tracing.
published_date 2011-10-01T03:09:26Z
_version_ 1763749885785407488
score 11.014358

Similar Items