A tetrahedra-based stream surface algorithm
Proceedings of the conference on Visualization '01
Constructing stream surfaces in steady 3D vector fields
VIS '92 Proceedings of the 3rd conference on Visualization '92
Topological Methods for 2D Time-Dependent Vector Fields Based on Stream Lines and Path Lines
IEEE Transactions on Visualization and Computer Graphics
Point-based stream surfaces and path surfaces
GI '07 Proceedings of Graphics Interface 2007
Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields
IEEE Transactions on Visualization and Computer Graphics
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Proceedings of the 2009 Computer Graphics International Conference
Streak Lines as Tangent Curves of a Derived Vector Field
IEEE Transactions on Visualization and Computer Graphics
Topologically relevant stream surfaces for flow visualization
Proceedings of the 25th Spring Conference on Computer Graphics
As-Perpendicular-as-possible surfaces for flow visualization
PACIFICVIS '12 Proceedings of the 2012 IEEE Pacific Visualization Symposium
Surface techniques for vortex visualization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
| Hi-index | 0.00 |
The generation of discrete stream surfaces is an important and challenging task in scientific visualization, which can be considered a particular instance of geometric modeling. The quality of numerically integrated stream surfaces depends on a number of parameters that can be controlled locally, such as time step or distance of adjacent vertices on the front line. In addition there is a parameter that cannot be controlled locally: stream surface meshes tend to show high quality, well-shaped elements only if the current front line is “globally” approximately perpendicular to the flow direction. We analyze the impact of this geometric property and present a novel solution – a stream surface integrator that forces the front line to be perpendicular to the flow and that generates quad-dominant meshes with well-shaped and well-aligned elements. It is based on the integration of a scaled version of the flow field, and requires repeated minimization of an error functional along the current front line. We show that this leads to computing the 1-dimensional kernel of a bidiagonal matrix: a linear problem that can be solved efficiently. We compare our method with existing stream surface integrators and apply it to a number of synthetic and real world data sets. © 2012 Wiley Periodicals, Inc.