Local bilinear computation of Jacobi sets
Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.
- Research Organization:
- Univ. of Utah, Salt Lake City, UT (United States)
- Sponsoring Organization:
- German Research Foundation (DFG); National Science Foundation (NSF); Swedish Research Council (VR); USDOE; USDOE Office of Science (SC)
- Grant/Contract Number:
- SC0021015
- OSTI ID:
- 1874619
- Journal Information:
- The Visual Computer, Journal Name: The Visual Computer Journal Issue: 9-10 Vol. 38; ISSN 0178-2789
- Publisher:
- Springer Science + Business MediaCopyright Statement
- Country of Publication:
- Germany
- Language:
- English
Similar Records
Robust Computation of Morse-Smale Complexes of Bilinear Functions
Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization