Sciweavers

IJRR
2002
129views more  IJRR 2002»
13 years 11 months ago
Deformable Free-Space Tilings for Kinetic Collision Detection
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
CG
2006
Springer
13 years 11 months ago
Approximate collision response using closest feature maps
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...
Thanh Giang, Carol O'Sullivan
VMV
2008
126views Visualization» more  VMV 2008»
14 years 26 days ago
Ray Tracing with the Single Slab Hierarchy
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarc...
Martin Eisemann, Christian Woizischke, Marcus A. M...
SI3D
1999
ACM
14 years 3 months ago
Computing bounding volume hierarchies using model simplification
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...
Tiow Seng Tan, Ket-Fah Chong, Kok-Lim Low
SIGGRAPH
2010
ACM
14 years 3 months ago
Subspace self-collision culling
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...
Jernej Barbic, Doug L. James
HAPTICS
2002
IEEE
14 years 4 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
VRCAI
2006
ACM
14 years 5 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
COMPGEOM
2006
ACM
14 years 5 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
VR
2007
IEEE
184views Virtual Reality» more  VR 2007»
14 years 5 months ago
Balanced Hierarchies for Collision Detection between Fracturing Objects
The simulation of fracture leads to collision-intensive situations that call for efficient collision detection algorithms and data structures. Bounding volume hierarchies (BVHs) ...
Miguel A. Otaduy, Olivier Chassot, Denis Steineman...