Abstract

Methods for vector field visualization strive to have a sparse representation of the field, while encoding all of its important features. Streamline visualization is one of the most popular such methods. Traditionally, a set of streamline methods have focused on capturing the salient features of the vector field such as sources, sinks, and vortices. However, not all features are created equal, and some features of the vector field are more important than others, which could simply be mere noise. It is this problem of characterizing feature importance through streamline visualization that we try to address in this paper. Specifically, a given 2D vector field can be decomposed into a rotation-free (gradient) component, divergence-free (curl) component and a harmonic component by the so-called Hodge decomposition. Features in the original vector field, in some sense, correspond to features in the first two components. Furthermore, the gradient and curl components are each induced by a scalar field. By analyzing these two corresponding scalar fields using topological methods (in particular the contour tree and the persistent homology), we develop a simple and novel algorithm whose streamline density tends to reflect the topological importance of the features in the input vector field. Such a feature-aware streamline sketch is more informative, yet still simple both visually and in terms of its generation. It enhances our understanding of the underlying vector field, which is demonstrated here by several experimental results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.