Particle Tracing on Sparse Grids

  • Christian Teitzel
  • Roberto Grosso
  • Thomas Ertl
Part of the Eurographics book series (EUROGRAPH)


These days sparse grids are of increasing interest in numerical simulations. Based upon hierarchical tensor product bases, the sparse grid approach is a very efficient one improving the ratio of invested storage and computing time to the achieved accuracy for many problems in the area of numerical solution of differential 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 girds 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.


Particle Trace Sparse Grid Cache Strategy Full Grid Data Compression Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H.-J. Bungartz. Dünne Gitter und deren Anwendung bei der adaptiven Lösung der dreidimensionalen Poisson-Gleichung. PhD thesis, TU Munich, 1992.Google Scholar
  2. 2.
    H.-J. Bungartz and T. Dornseifer. Sparse grids: Recent developments for elliptic partial differential equations. Technical report, TU Munich, 1997.Google Scholar
  3. 3.
    M. Griebel, W. Huber, U. Rüde, and T. Störtkuhl. The combination technique for parallel sparse-grid-preconditioning or -solution of pde’s on multiprocessor machines and workstation networks. In L. Bougé, M. Cosnard, Y. Robert, and D. Trystram, editors, Second Joint International Conference on Vector and Parallel Processing, pages 217–228, Berlin, 1992. CONPAR/VAPP, Springer-Verlag.Google Scholar
  4. 4.
    M. Griebel, M. Schneider, and C. Zenger. A combination technique for the solution of sparse grid problems. In P. de Groen and R. Beauwens, editors, International Symposium, on Iterative Methods in Linear Algebra, pages 263–281, Amsterdam, 1992. IMACS, Elsevier.Google Scholar
  5. 5.
    R. Grosso, M. Schulz, T. Ertl. Fast and accurate visualization of steady and unsteady flows. Technical Report 3, University of Erlangen, 1996.Google Scholar
  6. 6.
    R. Grosso, M. Schulz, J. Kraheberger, and T. Ertl. Flow visualization for multi- block multigrid simulations. In Virtual Environments and Scientific Visualization’96, Heidelberg, 1996. Springer-Verlag.Google Scholar
  7. 7.
    N. Heußer and M. Rumpf. Efficient visualization of data on sparse grids. In H.-C. Hege, K. Polthier, editors, Visualization and Mathematics, Berlin. Springer- Verlag. In preparation.Google Scholar
  8. 8.
    D. N. Kenwright and D. A. Lane. Optimization of Time-Dependent Particle Tracing Using Tetrahedral decomposition. In G. M. Nielson and Silver D., editors, Visualization’95, pages 321–328, Los Alamitos, CA, 1995. IEEE Computer Society, IEEE Computer Society Press.Google Scholar
  9. 9.
    C. Teitzel, R. Grosso, and T. Ertl. Efficient and Reliable Integration Methods for Particle Tracing in Unsteady Flows on Discrete Meshes. In W. Lefer and M. Grave, editors, Visualization in Scientific Computing’97, pages 31–41, Wien, April 1997. Springer-Verlag. Proceedings of the Eurographics Workshop in Boulogne-sur-Mer, France.CrossRefGoogle Scholar
  10. 10.
    C. Zenger. Sparse grids. In Parallel Algorithms for Partial Differential Equations: Proceedings of the Sixth GAMM-Seminar, Kiel, 1990.Google Scholar

Copyright information

© Springer-Verlag/Wien 1998

Authors and Affiliations

  • Christian Teitzel
    • 1
  • Roberto Grosso
    • 1
  • Thomas Ertl
    • 1
  1. 1.Computer Graphics GroupUniversity of ErlangenErlangenGermany

Personalised recommendations