Back to Search
Start Over
A Tetrahedra-Based Stream Surface Algorithm
- Source :
- Scheuermann, Gerik; Bobach, T.; Hagen, Hans; Mahrous, Karim; Hamann, Bernd; Joy, Ken; et al.Ertl, Thomas; Joy, Ken; & Varshney, A.(2001). A Tetrahedra-Based Stream Surface Algorithm. UC Davis: Institute for Data Analysis and Visualization. Retrieved from: http://www.escholarship.org/uc/item/86z9x1cc
- Publication Year :
- 2001
- Publisher :
- eScholarship, University of California, 2001.
-
Abstract
- This paper presents a new algorithm for the calculation of stream surfaces for tetrahedral grids. It propagates the surface through the tetrahedra, one at a time, calculating the intersections with the tetrahedral faces. The method allows us to incorporate topological information from the cells, e.g., critical points. The calculations are based on barycentric coordinates, since this simplifies theory and algorithm. The stream surfaces are ruled surfaces inside each cell, and their construction is started with line segments on the faces. Our method supports the analysis of velocity fields resulting from computational fluid dynamics (CFD) simulations.
Details
- Language :
- English
- Database :
- OpenAIRE
- Journal :
- Scheuermann, Gerik; Bobach, T.; Hagen, Hans; Mahrous, Karim; Hamann, Bernd; Joy, Ken; et al.Ertl, Thomas; Joy, Ken; & Varshney, A.(2001). A Tetrahedra-Based Stream Surface Algorithm. UC Davis: Institute for Data Analysis and Visualization. Retrieved from: http://www.escholarship.org/uc/item/86z9x1cc
- Accession number :
- edsair.doi.dedup.....13e9a55d2e98d8b88001437f9246e07a