Show simple item record

dc.contributor.authorTeitzel, Christianen_US
dc.contributor.authorGrosso, Robertoen_US
dc.contributor.authorErtl, Thomasen_US
dc.contributor.editorBartz, Dirken_US
dc.date.accessioned2015-11-19T09:53:14Z
dc.date.available2015-11-19T09:53:14Z
dc.date.issued1998en_US
dc.identifier.isbn3-211-83209-2en_US
dc.identifier.issn-en_US
dc.identifier.urihttp://dx.doi.org/10.2312/vissym19981007en_US
dc.description.abstractThese days sparse grids are of increasing interest in numerical simulations. Based upon hierarchical tensor product bases, the sparse grid approach is a very e cient one improving the ratio of invested storage and computing time to the achieved accuracy for many problems in the area of numerical solution of di erential equations, for instance in numerical fluid mechanics. The particle tracing algorithms that are available so far cannot cope with sparse grids. Now we present an approach that directly works on sparse grids. As a second aspect in this paper, we suggest to use sparse grids as a data compression method in order to visualize huge data sets even on small workstations. Because the size of data sets used in numerical simulations is still growing, this feature makes it possible that workstations can continue to handle these data sets.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleParticle Tracing on Sparse Gridsen_US
dc.description.seriesinformationVisualization in Scientific Computing '98en_US
dc.description.sectionheadersFlow Visualizationen_US
dc.identifier.doi10.2312/vissym19981007en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record