221 search results - page 3 / 45 » Zonotopes as bounding volumes |
ISVC
2009
Springer
13 years 11 months ago
2009
Springer
We developed a GPU-based volume ray casting system for rendering multiple arbitrarily overlapping multi-resolution volume data sets. Our efficient volume virtualization scheme is b...
GD
2003
Springer
13 years 10 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
CGF
2007
13 years 4 months ago
2007
We propose a variational approach to computing an optimal segmentation of a 3D shape for computing a union of tight bounding volumes. Based on an affine invariant measure of e-ti...
SI3D
1999
ACM
13 years 9 months ago
1999
ACM
This paper presents a framework that uses the outputs of model simplification to guide the construction of bounding volume hierarchies for use in, for example, collision detection...