102 search results - page 6 / 21 » Computing bounding volume hierarchies using model simplifica... |
SI3D
2003
ACM
14 years 22 days ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
CGF
2006
13 years 7 months ago
2006
We propose a sweep-based approach to the freeform deformation of three-dimensional objects. Instead of using a volume enclosing the whole object, we approximate only its deformabl...
WSCG
2003
13 years 8 months ago
2003
We present novel algorithms for efficient hierarchical collision detection and propose a hardware architecture for a single-chip accelerator. We use a hierarchy of bounding volum...
MST
1998
13 years 7 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...