221 search results - page 5 / 45 » Zonotopes as bounding volumes |
WWW
2003
ACM
14 years 6 months ago
2003
ACM
This paper presents a prediction algorithm for estimating the upper bound of future Web traffic volume. Unlike traditional traffic predictions that are performed at a single time ...
WEA
2009
Springer
14 years 17 days ago
2009
Springer
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 f...
SIGGRAPH
2009
ACM
14 years 8 days ago
2009
ACM
We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on ...
STOC
1992
ACM
13 years 9 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
CGF
2006
13 years 5 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...