Sciweavers

102 search results - page 7 / 21
» Computing bounding volume hierarchies using model simplifica...
Sort
View
SI3D
1999
ACM
13 years 11 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
SIGGRAPH
2010
ACM
13 years 12 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
TVCG
2011
274views more  TVCG 2011»
13 years 2 months ago
Memory-Scalable GPU Spatial Hierarchy Construction
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
VRST
2003
ACM
14 years 22 days ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
RT
1999
Springer
13 years 11 months ago
Decoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
Rüdiger Westermann, Ove Sommer, Thomas Ertl