102 search results - page 3 / 21 » Computing bounding volume hierarchies using model simplifica... |
CAD
2007
Springer
13 years 6 months ago
2007
Springer
The swept volume of a moving solid is a powerful computational and visualization concept. It provides an excellent aid for path and accessibility planning in robotics and for simu...
GRAPHICSINTERFACE
2003
13 years 7 months ago
2003
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
SGP
2003
13 years 7 months ago
2003
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual h...
SIGGRAPH
2000
ACM
13 years 9 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
CG
2006
Springer
13 years 6 months ago
2006
Springer
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated wi...