Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/1724
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | HUBO, Erik | - |
dc.contributor.author | MERTENS, Tom | - |
dc.contributor.author | HABER, Tom | - |
dc.contributor.author | BEKAERT, Philippe | - |
dc.date.accessioned | 2007-07-16T08:59:27Z | - |
dc.date.available | 2007-07-16T08:59:27Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Wald, I. & Parker, S.G. (Ed.) IEEE Symposium on Interactive Ray Tracing. p. 105-113. | - |
dc.identifier.uri | http://hdl.handle.net/1942/1724 | - |
dc.description.abstract | Both ray tracing and point-based representations provide means to efficiently display very complex 3D models. Computational efficiency has been the main focus of previous work on ray tracing point-sampled surfaces. For very complex models efficient storage in the form of compression becomes necessary in order to avoid costly disk access. However, as ray tracing requires neighborhood queries, existing compression schemes cannot be applied because of their sequential nature. This paper introduces a novel acceleration structure called the quantized kd-tree, which offers both efficient traversal and storage. The gist of our new representation lies in quantizing the kd-tree splitting plane coordinates. We show that the quantized kd-tree reduces the memory footprint up to 18 times, not compromising performance. Moreover, the technique can also be employed to provide LOD (level-of-detail) to reduce aliasing problems, with little additional storage cost. | - |
dc.format.extent | 4973545 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | The quantized kd-tree: efficient ray tracing of compressed point clouds | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Wald, I. | - |
local.bibliographicCitation.authors | Parker, S.G. | - |
local.bibliographicCitation.conferencename | IEEE Symposium on Interactive Ray Tracing | - |
local.bibliographicCitation.conferenceplace | Salt Lake City, USA | - |
dc.identifier.epage | 113 | - |
dc.identifier.spage | 105 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.isi | 000245159000014 | - |
local.bibliographicCitation.btitle | IEEE Symposium on Interactive Ray Tracing | - |
item.validation | ecoom 2008 | - |
item.contributor | HUBO, Erik | - |
item.contributor | MERTENS, Tom | - |
item.contributor | HABER, Tom | - |
item.contributor | BEKAERT, Philippe | - |
item.accessRights | Open Access | - |
item.fullcitation | HUBO, Erik; MERTENS, Tom; HABER, Tom & BEKAERT, Philippe (2006) The quantized kd-tree: efficient ray tracing of compressed point clouds. In: Wald, I. & Parker, S.G. (Ed.) IEEE Symposium on Interactive Ray Tracing. p. 105-113.. | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Quantitized.pdf | Peer-reviewed author version | 4.86 MB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
28
checked on May 2, 2024
Page view(s)
60
checked on Aug 2, 2022
Download(s)
192
checked on Aug 2, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.