6 search results - page 1 / 2 » Out-of-core simplification of large polygonal models |
SIGGRAPH
2000
ACM
13 years 8 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
CGA
2008
13 years 4 months ago
2008
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...
GRAPHICSINTERFACE
2000
13 years 5 months ago
2000
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...
VISUALIZATION
1998
IEEE
13 years 8 months ago
1998
IEEE
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 ...
WSCG
2001
13 years 5 months ago
2001
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...