Geometry Presorting for Implicit Object Space Partitioning

We present a new data structure for object space partitioning that can be represented completely implicitly. The bounds of each node in the tree structure are recreated at run‐time from the scene objects contained therein. By applying a presorting procedure to the geometry, only a known fraction of...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer graphics forum Ročník 31; číslo 4; s. 1445 - 1454
Hlavní autori: Eisemann, M., Bauszat, P., Guthe, S., Magnor, M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford, UK Blackwell Publishing Ltd 01.06.2012
Predmet:
1.3.6 [Computer Graphics]: Methodology and Techniques-Graphics data structures and data types
1.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism-Raytracing
Algorithms
Computer graphics
Frames
Geometry
Hardware
Hierarchies
Interactive
Partitioning
Planes
Representations
Studies
ISSN:0167-7055, 1467-8659
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a new data structure for object space partitioning that can be represented completely implicitly. The bounds of each node in the tree structure are recreated at run‐time from the scene objects contained therein. By applying a presorting procedure to the geometry, only a known fraction of the geometry is needed to locate the bounding planes of any node. We evaluate the impact of the implicit bounding plane representation and compare our algorithm to a classic bounding volume hierarchy. Though the representation is completely implicit, we still achieve interactive frame rates on commodity hardware.
Bibliografia:istex:219676EF652DCDA8829696A3F589DD543BF9135E
ark:/67375/WNG-0Z64X77M-1
ArticleID:CGF3140
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/j.1467-8659.2012.03140.x