Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Area and volume coherence for efficient visualization of 3D scalar functions
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Automatic mesh generator with specified boundary
Computer Methods in Applied Mechanics and Engineering
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Fast and memory efficient polygonal simplification
Proceedings of the conference on Visualization '98
Simplification of tetrahedral meshes
Proceedings of the conference on Visualization '98
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
R-tree retrieval of unstructured volume data for visualization
External memory algorithms
A point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Simplification of Tetrahedral meshes with accurate error evaluation
Proceedings of the conference on Visualization '00
Geometry and topology for mesh generation
Geometry and topology for mesh generation
Conforming Delaunay triangulations in 3D
Proceedings of the eighteenth annual symposium on Computational geometry
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Constructing Hierarchies for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Simplification of Tetrahedral Meshes with Error Bounds
IEEE Transactions on Visualization and Computer Graphics
Time-Critical Rendering of Irregular Grids
SIBGRAPI '00 Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing
Volume Decimation of Irregular Tetrahedral Grids
CGI '99 Proceedings of the International Conference on Computer Graphics
Simplification of Three-Dimensional Density Maps
IEEE Transactions on Visualization and Computer Graphics
Quadric-based simplification in any dimension
ACM Transactions on Graphics (TOG)
3D Game Engine Architecture: Engineering Real-Time Applications with Wild Magic (The Morgan Kaufmann Series in Interactive 3D Technology)
Meshless isosurface generation from multiblock data
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Streaming Simplification of Tetrahedral Meshes
IEEE Transactions on Visualization and Computer Graphics
Scalable Hybrid Unstructured and Structured Grid Raycasting
IEEE Transactions on Visualization and Computer Graphics
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part I
| Hi-index | 0.00 |
Tetrahedral meshes are widely used in scientific computing for representing three-dimensional scalar, vector, and tensor fields. The size and complexity of some of these meshes can limit the performance of many visualization algorithms, making it hard to achieve interactive visualization. The use of simplified models is one way to enable the real-time exploration of these datasets. In this paper, we propose a novel technique for simplifying large unstructured meshes. Most current techniques simplify the geometry of the mesh using edge collapses. Our technique simplifies an underlying scalar field directly by segmenting the original scalar field into two pieces: the boundary of the original domain and the interior samples of the scalar field. We then simplify each piece separately, taking into account proper error bounds. Finally, we combine the simplified domain boundary and scalar field into a complete, simplified mesh that can be visualized with standard unstructured-data visualization tools. Our technique is much faster than edge-collapse-based simplification approaches. Furthermore, it is particularly suitable for aggressive simplification. Experiments show that isosurfaces and volume renderings of meshes produced by our technique have few noticeable visual artifacts.