Stream Volume Segmentation of Grid-Less Flow Simulation
We present a novel algorithm for the geometric extraction of stream volume segmentation for visualization of grid-less flow simulations. Our goal is the segmentation of different paths through a mixing tube where the flow is represented by scattered point sets approximated with moving least squares. The key challenges are thewatertight construction of boundary representations from separatrices. These are obtained by integrating and intersectingstream surfaces starting at separation and attachment lines at boundaries of flow obstacles. A major challenge is the robust integration of stream lines at boundaries with no-slip condition such that closed volume segments are obtained. Our results show the segmentation of volumes taking consistent paths through a mixing tube with six partitioning blades. Slicing these volumes provides valuable insight into the quality of the mixing process.
KeywordsBoundary Object Separation Line Stream Line Move Little Square Stream Surface
Unable to display preview. Download preview PDF.
This work was supported by the German Research Foundation (IRTG 1131) and by the Center for Mathematical and Computational Modeling (CM)2.
- 1.H. Battke, D. Stalling, H-C. Hege: Fastline integral convolution for arbitrary surfaces in 3D. Visualization and mathematics: experiments, simulations and environments, 1997, 181–ffGoogle Scholar
- 2.B. G. Becker, D. A. Lane, N. L. Max: Unsteady Flow Volumes. Proceedings of Visualization 1995, 329Google Scholar
- 3.J. E. Bresenham: Algorithm for Computer Control of a Digital Plotter. IBM Systems Journal, Vol. 4, No. 1, 25–30 (1965)Google Scholar
- 4.C. Garth, H. Krishnan, X. Tricoche, T. Bobach, K. I. Joy. Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields. IEEE TVCG, Vol. 14, No. 6, 1404–1411 (2008)Google Scholar
- 5.A. Globus, C. Levit, T. Lasinski: A Tool for Visualizing the Topology of Three-Dimensional Vector Fields. NASA Ames Research Center, Computer Sciences CorporationGoogle Scholar
- 6.J. P. M. Hultquist: Constructingstream surfaces in steady 3D vector fields. Proceedings of Visualization 1992, 173–175Google Scholar
- 7.D. N. Kenwright, C. Henze, C. Levit: Feature Extraction of Separation and Attachment Lines. IEEE TVCG 5, 2 1999, 135–144Google Scholar
- 8.D. Levin: The Approximation Power of Moving Least-Squares. Mathematics of Computation, Vol. 67, No. 224. October 1998, 1517–1531Google Scholar
- 9.A. Nealen: An As-Short-As-Possible Introduction to the Least Squares, Weighted Least Squares and Moving Least Squares Methods for Scattered Data Approximation and Interpolation. Technical Report, Discrete Geometric Modeling Group, TU DarmstadtGoogle Scholar
- 10.W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press. 1992.Google Scholar
- 11.G. Scheuermann, T. Bobach, H. Hagen, K. Mahrous, B. Hamann, K. I. Joy, W. Kollmann: Atetrahedra-basedstream surface algorithm. Proceedings of IEEE Visualization 2001, 151–158Google Scholar
- 12.S. U. Sikorski, C. K. Ma: Efficient Streamline, Streamribbon, and Streamtube Constructions on Unstructured Grids. IEEE TVCG, Volume 2, No. 2, 100–110 (1996)Google Scholar
- 13.M. Spiegelman: Myths and Methods in Modeling. LDEO, Columbia University. chapter 4 (2000)Google Scholar
- 14.S. Tiwari, J. Kuhnert: A numerical scheme for solving incompressible and low mach number flows byFinite Pointset method. Technical Report, Fraunhofer ITWM, KaiserslauternGoogle Scholar
- 15.A. Wiebel, X. Tricoche, G. Scheuermann: Extraction of Separation Manifolds using Topological Structures in Flow Cross Sections. Topology-Based Methods in Visualization II, Springer (2009)Google Scholar
- 16.J. J. van Wijk: ImplicitStream Surfaces. Proceedings of the 4th Conference on Visualization 1993, 245–252Google Scholar