Sciweavers

4 search results - page 1 / 1
» Fast and memory efficient polygonal simplification
Sort
View
VISUALIZATION
1998
IEEE
13 years 9 months ago
Fast and memory efficient polygonal simplification
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification ...
Peter Lindstrom, Greg Turk
3DIM
2005
IEEE
13 years 10 months ago
Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
Peiran Liu, Xiaojun Shen, Nicolas D. Georganas, Ge...
CGF
2008
165views more  CGF 2008»
13 years 5 months ago
GPU-based Fast Ray Casting for a Large Number of Metaballs
Metaballs are implicit surfaces widely used to model curved objects, represented by the isosurface of a density field defined by a set of points. Recently, the results of particle...
Yoshihiro Kanamori, Zoltan Szego, Tomoyuki Nishita
GRAPHITE
2007
ACM
13 years 8 months ago
Visibility map for global illumination in point clouds
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
Rhushabh Goradia, Anil Kanakanti, Sharat Chandran,...