Sciweavers

32 search results - page 4 / 7
» Efficient Simplification of Point-Sampled Surfaces
Sort
View
WSCG
2003
166views more  WSCG 2003»
13 years 8 months ago
View-Dependent Multiresolution Model For Foliage
Real-time rendering of vegetation is one of the most important challenges in outdoor scenes. This is due to the vast amount of polygons that are used to model vegetable species. M...
Inmaculada Remolar, Miguel Chover, José Rib...
CAGD
2005
203views more  CAGD 2005»
13 years 7 months ago
Anisotropic smoothing of point sets,
The use of point sets instead of meshes became more popular during the last years. We present a new method for anisotropic fairing of a point sampled surface using an anisotropic ...
Carsten Lange, Konrad Polthier
GRAPHICSINTERFACE
2009
13 years 5 months ago
Fast low-memory streaming MLS reconstruction of point-sampled surfaces
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
Gianmauro Cuccuru, Enrico Gobbetti, Fabio Marton, ...
GRC
2008
IEEE
13 years 8 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
CGF
2006
107views more  CGF 2006»
13 years 7 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...