RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies

Cited 16 time in webofscience Cited 0 time in scopus
  • Hit : 358
  • Download : 500
DC FieldValueLanguage
dc.contributor.authorKim, Tae-Joonko
dc.contributor.authorMoon, Bo-Changko
dc.contributor.authorKim, Duk-Suko
dc.contributor.authorYoon, Sung-Euiko
dc.date.accessioned2011-03-21T06:20:03Z-
dc.date.available2011-03-21T06:20:03Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2010-
dc.identifier.citationIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, v.16, no.2, pp.273 - 286-
dc.identifier.issn1077-2626-
dc.identifier.urihttp://hdl.handle.net/10203/22836-
dc.description.abstractWe present a novel compressed bounding volume hierarchy (BVH) representation, random-accessible compressed bounding volume hierarchies (RACBVHs), for various applications requiring random access on BVHs of massive models. Our RACBVH representation is compact and transparently supports random access on the compressed BVHs without decompressing the whole BVH. To support random access on our compressed BVHs, we decompose a BVH into a set of clusters. Each cluster contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Also, each cluster is compressed separately from other clusters and serves as an access point to the RACBVH representation. We provide the general BVH access API to transparently access our RACBVH representation. At runtime, our decompression framework is guaranteed to provide correct BV nodes without decompressing the whole BVH. Also, our method is extended to support parallel random access that can utilize the multicore CPU architecture. Our method can achieve up to a 12:1 compression ratio, and more importantly, can decompress 4.2 M BV nodes (=135 MB) per second by using a single CPU-core. To highlight the benefits of our approach, we apply our method to two different applications: ray tracing and collision detection. We can improve the runtime performance by more than a factor of 4 as compared to using the uncompressed original data. This improvement is a result of the fast decompression performance and reduced data access time by selectively fetching and decompressing small regions of the compressed BVHs requested by applications.-
dc.description.sponsorshipWe would like to thank anonymous reviewers for their constructive feedbacks. We also thank Paul Merrell and members of KAIST SGLab. for their English review and helpful feedbacks. The St. Matthew and Lucy model are courtesy of Stanford University. The isosurface model is courtesy of the LLNL. The power plant model and CAD turbine models are courtesy of an anonymous donor and of Kitware respectively. This project was supported in part by MKE/MCST/IITA [2008-F-033-02,2009-S-001- 01], MCST/KEIT [2006-S-045-1], MKE/IITA u-Learning, MKE digital mask control, MCST/KOCCA-CTR&DP- 2009, KRF-2008-313-D00922, and MSRA E-heritage.en
dc.languageEnglish-
dc.language.isoen_USen
dc.publisherIEEE COMPUTER SOC-
dc.subjectCOLLISION DETECTION-
dc.subjectTRIANGLE MESHES-
dc.subjectTREES-
dc.titleRACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies-
dc.typeArticle-
dc.identifier.wosid000273396600009-
dc.identifier.scopusid2-s2.0-76849106074-
dc.type.rimsART-
dc.citation.volume16-
dc.citation.issue2-
dc.citation.beginningpage273-
dc.citation.endingpage286-
dc.citation.publicationnameIEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS-
dc.identifier.doi10.1109/TVCG.2009.71-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorYoon, Sung-Eui-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorHierarchy and BVH compression-
dc.subject.keywordAuthorrandom access-
dc.subject.keywordAuthorcache-coherent layouts-
dc.subject.keywordAuthorray tracing-
dc.subject.keywordAuthorcollision detection-
dc.subject.keywordPlusCOLLISION DETECTION-
dc.subject.keywordPlusTRIANGLE MESHES-
dc.subject.keywordPlusTREES-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 16 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0