Data-Dependent Surface Simplification

Simple item page
dc.contributor.authorFrank, Karinen_US
dc.contributor.authorLang, Ulrichen_US
dc.contributor.editorBartz, Dirken_US
dc.date.accessioned2015-11-19T09:53:12Z
dc.date.available2015-11-19T09:53:12Z
dc.date.issued1998en_US
dc.description.abstractIn Scientific Visualization, surfaces have often attached data, e. g. cutting surfaces or isosurfaces in numerical simulations with multiple data components. These surfaces can be e. g. the output of a marching cubes algorithm which produces a large number of very small triangles. Existing triangle decimation algorithms use purely geometric criteria to simplify oversampled surfaces. This approach can lead to coarse representations of the surface in areas with high data gradients, thus loosing important information. In this paper, a data-dependent reduction algorithm for arbitrary triangulated surfaces is presented using besides geometric criteria a gradient approximation of the data to de ne the order of geometric elements to be removed. Examples show that the algorithm works su ciently fast to be used interactively in a VR environment and allows relatively high reduction rates keeping a good quality representation of the surface.en_US
dc.description.sectionheadersAdaptive and Multi-resolution Methodsen_US
dc.description.seriesinformationVisualization in Scientific Computing '98en_US
dc.identifier.doi10.2312/vissym19981000en_US
dc.identifier.isbn3-211-83209-2en_US
dc.identifier.issn-en_US
dc.identifier.urihttps://doi.org/10.2312/vissym19981000en_US
dc.publisherThe Eurographics Associationen_US
dc.titleData-Dependent Surface Simplificationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_frank.pdf
Size:
586.46 KB
Format:
Adobe Portable Document Format
Download
Collections
VisSci98: 9th Eurographics Workshop on Visualization in Scientific Computing'98