Simplification of unstructured tetrahedral meshes by point sampling

Dirce Uesu, Louis Bavoil, Shachar Fleishman, Jason Shepherd, Cláudio T. Silva

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationVolume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics
Pages157-165
Number of pages9
StatePublished - 2005
EventFourth International Workshop on Volume Graphics 2005 - Stony Brook, NY, United States
Duration: Jun 20 2005Jun 21 2005

Other

OtherFourth International Workshop on Volume Graphics 2005
CountryUnited States
CityStony Brook, NY
Period6/20/056/21/05

Fingerprint

Visualization
Sampling
Natural sciences computing
Volume rendering
Data visualization
Tensors
Geometry
Experiments

Keywords

  • Jevel-of-detail
  • Mesh simplification
  • Point sampling
  • Unstructured meshes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Uesu, D., Bavoil, L., Fleishman, S., Shepherd, J., & Silva, C. T. (2005). Simplification of unstructured tetrahedral meshes by point sampling. In Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics (pp. 157-165). [1500537]

Simplification of unstructured tetrahedral meshes by point sampling. / Uesu, Dirce; Bavoil, Louis; Fleishman, Shachar; Shepherd, Jason; Silva, Cláudio T.

Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics. 2005. p. 157-165 1500537.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Uesu, D, Bavoil, L, Fleishman, S, Shepherd, J & Silva, CT 2005, Simplification of unstructured tetrahedral meshes by point sampling. in Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics., 1500537, pp. 157-165, Fourth International Workshop on Volume Graphics 2005, Stony Brook, NY, United States, 6/20/05.
Uesu D, Bavoil L, Fleishman S, Shepherd J, Silva CT. Simplification of unstructured tetrahedral meshes by point sampling. In Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics. 2005. p. 157-165. 1500537
Uesu, Dirce ; Bavoil, Louis ; Fleishman, Shachar ; Shepherd, Jason ; Silva, Cláudio T. / Simplification of unstructured tetrahedral meshes by point sampling. Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics. 2005. pp. 157-165
@inproceedings{f505ac64d70c4f35bad8216aa6e579d6,
title = "Simplification of unstructured tetrahedral meshes by point sampling",
abstract = "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.",
keywords = "Jevel-of-detail, Mesh simplification, Point sampling, Unstructured meshes",
author = "Dirce Uesu and Louis Bavoil and Shachar Fleishman and Jason Shepherd and Silva, {Cl{\'a}udio T.}",
year = "2005",
language = "English (US)",
isbn = "3905673266",
pages = "157--165",
booktitle = "Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics",

}

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.

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

M3 - Conference contribution

SN - 3905673266

SN - 9783905673265

SP - 157

EP - 165

BT - Volume Graphics 2005 Eurographics/IEEE VGTC Workshop Proceedings - Fourth International Workshop on Volume Graphics

ER -