File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1111/cgf.13948
- Scopus: eid_2-s2.0-85087777503
- WOS: WOS:000548709600042
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Binary Ostensibly-Implicit Trees for Fast Collision Detection
Title | Binary Ostensibly-Implicit Trees for Fast Collision Detection |
---|---|
Authors | |
Keywords | CCS Concepts • Computing methodologies → Collision detection |
Issue Date | 2020 |
Citation | Computer Graphics Forum, 2020, v. 39, n. 2, p. 509-521 How to Cite? |
Abstract | © 2020 The Author(s) Computer Graphics Forum © 2020 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. We present a simple, efficient and low-memory technique, targeting fast construction of bounding volume hierarchies (BVH) for broad-phase collision detection. To achieve this, we devise a novel representation of BVH trees in memory. We develop a mapping of the implicit index representation to compact memory locations, based on simple bit-shifts, to then construct and evaluate bounding volume test trees (BVTT) during collision detection with real-time performance. We model the topology of the BVH tree implicitly as binary encodings which allows us to determine the nodes missing from a complete binary tree using the binary representation of the number of missing nodes. The simplicity of our technique allows for fast hierarchy construction achieving over 6× speedup over the state-of-the-art. Making use of these characteristics, we show that not only it is feasible to rebuild the BVH at every frame, but that using our technique, it is actually faster than refitting and more memory efficient. |
Persistent Identifier | http://hdl.handle.net/10722/288819 |
ISSN | 2023 Impact Factor: 2.7 2023 SCImago Journal Rankings: 1.968 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chitalu, Floyd M. | - |
dc.contributor.author | Dubach, Christophe | - |
dc.contributor.author | Komura, Taku | - |
dc.date.accessioned | 2020-10-12T08:05:57Z | - |
dc.date.available | 2020-10-12T08:05:57Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Computer Graphics Forum, 2020, v. 39, n. 2, p. 509-521 | - |
dc.identifier.issn | 0167-7055 | - |
dc.identifier.uri | http://hdl.handle.net/10722/288819 | - |
dc.description.abstract | © 2020 The Author(s) Computer Graphics Forum © 2020 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. We present a simple, efficient and low-memory technique, targeting fast construction of bounding volume hierarchies (BVH) for broad-phase collision detection. To achieve this, we devise a novel representation of BVH trees in memory. We develop a mapping of the implicit index representation to compact memory locations, based on simple bit-shifts, to then construct and evaluate bounding volume test trees (BVTT) during collision detection with real-time performance. We model the topology of the BVH tree implicitly as binary encodings which allows us to determine the nodes missing from a complete binary tree using the binary representation of the number of missing nodes. The simplicity of our technique allows for fast hierarchy construction achieving over 6× speedup over the state-of-the-art. Making use of these characteristics, we show that not only it is feasible to rebuild the BVH at every frame, but that using our technique, it is actually faster than refitting and more memory efficient. | - |
dc.language | eng | - |
dc.relation.ispartof | Computer Graphics Forum | - |
dc.subject | CCS Concepts | - |
dc.subject | • Computing methodologies → Collision detection | - |
dc.title | Binary Ostensibly-Implicit Trees for Fast Collision Detection | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1111/cgf.13948 | - |
dc.identifier.scopus | eid_2-s2.0-85087777503 | - |
dc.identifier.volume | 39 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 509 | - |
dc.identifier.epage | 521 | - |
dc.identifier.eissn | 1467-8659 | - |
dc.identifier.isi | WOS:000548709600042 | - |
dc.identifier.issnl | 0167-7055 | - |