12 search results - page 1 / 3 » Spatial splits in bounding volume hierarchies |
64
Voted
EGH
2009
Springer
14 years 7 months ago
2009
Springer
CGF
2006
14 years 9 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...
TVCG
2011
14 years 4 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
163
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
119
click to vote
CGF
2010
14 years 8 months ago
2010
A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequen...