Efficient collision detection for spherical blend skinning
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Multimorphing: A tool for shape synthesis and analysis
Advances in Engineering Software
Bounded normal trees for reduced deformations of triangulated surfaces
Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
A comparison of sampling strategies for computing general sweeps
Computer-Aided Design
| Hi-index | 0.00 |
Bounding volumes are crucial for culling in interactivegraphics applications. For dynamic shapes, computing abounding volume for each frame could be very expensive.We analyze the situation for a particular class of dynamicgeometry, namely, shapes resulting from the linear interpolationof several base shapes. The space of weights for thelinear combination can be decomposed into cells so that ineach cell a particular vertex is maximal (resp. minimal) in agiven direction. This cell decomposition of the weight spaceallows deriving bounding volumes from the weight vectorsrather than the generated geometry. We present algorithmsto generate the cell decomposition, to map from weights tocells, and to efficiently compute the necessary data structures.This approach to computing bounding volumes fordynamic shapes proves to be beneficial if the geometry representationis large compared to the number of base shapes.