SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Matrix computations (3rd ed.)
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Simplification of Tetrahedral Meshes with Error Bounds
IEEE Transactions on Visualization and Computer Graphics
Out-of-core construction and visualization of multiresolution surfaces
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
Simplification of Three-Dimensional Density Maps
IEEE Transactions on Visualization and Computer Graphics
Encoding Volumetric Grids For Streaming Isosurface Extraction
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Simplification and improvement of tetrahedral models for simulation
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
ACM SIGGRAPH 2005 Papers
Streaming compression of triangle meshes
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Simplification of unstructured tetrahedral meshes by point sampling
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
Multilevel streaming for out-of-core surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Processing of volumetric data by slice- and process-based streaming
AFRIGRAPH '07 Proceedings of the 5th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Viewpoint-based simplification using f-divergences
Information Sciences: an International Journal
Streaming tetrahedral mesh optimization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Streaming Mesh Optimization for CAD
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
SOT: compact representation for tetrahedral meshes
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
MCGIM-based model streaming for realtime progressive rendering
Journal of Computer Science and Technology - Special issue on natural language processing
Out-of-core simplification and crack-free LOD volume rendering for irregular grids
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Streaming-enabled parallel dataflow architecture for multicore systems
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for streaming simplification of large tetrahedral meshes. Our algorithm arranges the data on disk in a streaming, I/O-efficient format that allows coherent access to the tetrahedral cells. A quadric-based simplification is sequentially performed on small portions of the mesh in-core. Our output is a coherent streaming mesh which facilitates future processing. Our technique is fast, produces high quality approximations, and operates out-of-core to process meshes too large for main memory.