Particle Tracing on Sparse Grids
| dc.contributor.author | Teitzel, Christian | en_US |
| dc.contributor.author | Grosso, Roberto | en_US |
| dc.contributor.author | Ertl, Thomas | en_US |
| dc.contributor.editor | Bartz, Dirk | en_US |
| dc.date.accessioned | 2015-11-19T09:53:14Z | |
| dc.date.available | 2015-11-19T09:53:14Z | |
| dc.date.issued | 1998 | en_US |
| dc.description.abstract | These 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.description.sectionheaders | Flow Visualization | en_US |
| dc.description.seriesinformation | Visualization in Scientific Computing '98 | en_US |
| dc.identifier.doi | 10.2312/vissym19981007 | en_US |
| dc.identifier.isbn | 3-211-83209-2 | en_US |
| dc.identifier.issn | - | en_US |
| dc.identifier.uri | https://doi.org/10.2312/vissym19981007 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Particle Tracing on Sparse Grids | en_US |
Files
Original bundle
1 - 1 of 1