A tetrahedra-based stream surface algorithm
Proceedings of the conference on Visualization '01
Fast Display of Illuminated Field Lines
IEEE Transactions on Visualization and Computer Graphics
Tools for Computing Tangent Curves for Linearly Varying Vector Fields over Tetrahedral Domains
IEEE Transactions on Visualization and Computer Graphics
Visualizing Vector Field Topology in Fluid Flows
IEEE Computer Graphics and Applications
A tool for visualizing the topology of three-dimensional vector fields
VIS '91 Proceedings of the 2nd conference on Visualization '91
Constructing stream surfaces in steady 3D vector fields
VIS '92 Proceedings of the 3rd conference on Visualization '92
Saddle Connectors - An Approach to Visualizing the Topological Skeleton of Complex 3D Vector Fields
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Point-based stream surfaces and path surfaces
GI '07 Proceedings of Graphics Interface 2007
Topologically relevant stream surfaces for flow visualization
Proceedings of the 25th Spring Conference on Computer Graphics
Surface techniques for vortex visualization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Smooth stream surfaces of fourth order precision
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Technical Section: Surface-based flow visualization
Computers and Graphics
| Hi-index | 0.00 |
We present an algorithm that allows stream surfaces to recognize and adapt to vector field topology. Standard stream surface algorithms either refine the surface uncontrolled near critical points which slows down the computation considerably and may lead to a poor surface approximation. Alternatively, the concerned region is omitted from the stream surface by severing it into two parts thus generating an incomplete stream surface. Our algorithm utilizes topological information to provide a fast, accurate, and complete triangulation of the stream surface near critical points. The required topological information is calculated in a preprocessing step. We compare our algorithm against the standard approach both visually and in performance.