Rotated-box trees: A lightweight c-oriented bounding-volume hierarchy

Autor:	Berg, de, M.T., Hachenberger, P., Vahrenhold, J.
Přispěvatelé:	Algorithms
Jazyk:	angličtina
Rok vydání:	2009
Předmět:	Combinatorics Discrete mathematics Fractal tree index K-ary tree Tree structure Segment tree Bounding volume hierarchy Bounding interval hierarchy Interval tree Mathematics Range tree
Zdroj:	Experimental Algorithms (8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings), 63-75 STARTPAGE=63;ENDPAGE=75;TITLE=Experimental Algorithms (8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings) Experimental Algorithms ISBN: 9783642020100 SEA
ISSN:	0302-9743
DOI:	10.1007/978-3-642-02011-7_8
Popis:	We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and experimentally compare our new c-rb-tree to two existing bounding-volumes hierarchies, namely c-dop-tree and box-trees. Both authors were supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 639.023.301. P.H. was also supported in part by a NABIIT grant from the Danish Strategic Research Council and by the Danish National Research Foundation.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c8304afbd421d42b2bd576dc01a009c https://doi.org/10.1007/978-3-642-02011-7_8 Zobrazit plný text záznamu