TY - GEN
T1 - Simplification of unstructured tetrahedral meshes by point sampling
AU - Uesu, Dirce
AU - Bavoil, Louis
AU - Fleishman, Shachar
AU - Shepherd, Jason
AU - Silva, Cláudio T.
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
KW - Jevel-of-detail
KW - Mesh simplification
KW - Point sampling
KW - Unstructured meshes
UR - http://www.scopus.com/inward/record.url?scp=33745265663&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745265663&partnerID=8YFLogxK
U2 - 10.1109/vg.2005.194110
DO - 10.1109/vg.2005.194110
M3 - Conference contribution
AN - SCOPUS:33745265663
SN - 3905673266
SN - 9783905673265
T3 - Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics
SP - 157
EP - 165
BT - Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - Fourth International Workshop on Volume Graphics 2005
Y2 - 20 June 2005 through 21 June 2005
ER -