DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lauterbach, Christian | ko |
dc.contributor.author | Yoon, Sung-Eui | ko |
dc.contributor.author | Tang, Ming | ko |
dc.contributor.author | Manocha, Dinesh | ko |
dc.date.accessioned | 2013-03-07T23:16:54Z | - |
dc.date.available | 2013-03-07T23:16:54Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-06 | - |
dc.identifier.citation | COMPUTER GRAPHICS FORUM, v.27, no.4, pp.1313 - 1321 | - |
dc.identifier.issn | 0167-7055 | - |
dc.identifier.uri | http://hdl.handle.net/10203/91531 | - |
dc.description.abstract | We present a novel representation and algorithm, ReduceM, for memory efficient ray tracing of large scenes. ReduceM exploits the connectivity between triangles in a mesh and decomposes the model into triangle strips. We also describe a new stripification algorithm, Strip-RT, that can generate long strips with high spatial coherence. Our approach uses a two-level traversal algorithm for ray-primitive intersection. In practice, ReduceM can significantly reduce the storage overhead and ray trace massive models with hundreds of millions of triangles at interactive rates on desktop PCs with 4-8GB of main memory. | - |
dc.language | English | - |
dc.publisher | BLACKWELL PUBLISHING | - |
dc.title | ReduceM: Interactive and memory efficient ray tracing of large models | - |
dc.type | Article | - |
dc.identifier.wosid | 000258223600029 | - |
dc.identifier.scopusid | 2-s2.0-51549106694 | - |
dc.type.rims | ART | - |
dc.citation.volume | 27 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 1313 | - |
dc.citation.endingpage | 1321 | - |
dc.citation.publicationname | COMPUTER GRAPHICS FORUM | - |
dc.identifier.doi | 10.1111/j.1467-8659.2008.01270.x | - |
dc.contributor.localauthor | Yoon, Sung-Eui | - |
dc.contributor.nonIdAuthor | Lauterbach, Christian | - |
dc.contributor.nonIdAuthor | Tang, Ming | - |
dc.contributor.nonIdAuthor | Manocha, Dinesh | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.