A memory insensitive technique for large model simplification

Proceedings of the IEEE Visualization Conference

Volumn , Issue , 2001, Pages 121-126

  Lindstrom, P ^a   Silva, C T ^a  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

External sorting; Large data; Out of core algorithms; Polygonal surface simplification; Quadric error metrics

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; DATA STORAGE EQUIPMENT;

POLYGONAL SURFACE SIMPLIFICATION;

COMPUTATIONAL GEOMETRY;

EID: 0035162683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Parallel accelerated isocontouring for out-of-core visualization
2. Case study: Scanning michaelangelo's florentine pietà
3. The ball-pivoting algorithm for surface reconstruction
4. I/O optimal isosurface extraction
5. Interactive out-of-core isosurface extraction
6. Application-controlled demand paging for out-of-core visualization
7. Geometry compression
8. External memory view-dependent simplification
9. Out-of-core rendering of large unstructured grids
10. Fast polygonal approximation of terrains and height fields
11. Surface simplification using quadric error metrics
12. Smooth view-dependent level-of-detail control and its application to terrain rendering
13. Fast retrieval of disk-resident unstructured volume data for visualization
14. The digital michelangelo project: 3D scanning of large statues
15. Out-of-core simplification of large polygonal models
16. Fast and memory efficient polygonal simplification
17. Evaluation of memoryless simplification
18. Very high resolution simulation of compressible turbulence on the IBM-SP system
19. Rendering complex scenes with memory-coherent ray tracing
20. Multi-resolution 3D approximation for rendering complex scenes
21. Efficient adaptive simplification of massive meshes
22. A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree
23. Automatic generation of triangular irregular networks using greedy cuts
24. Greedy cuts: An advancing front terrain triangulation algorithm
25. Accelerated isosurface extraction in time-varying fields
26. Out-of-core streamline visualization on large unstructured meshes