Papers › Approximate streamsurfaces for flow visualization
Approximate streamsurfaces for flow visualization
Stergios Katsanoulis, Florian Kogelbauer, Roshan Kaundinya, Jesse Ault, George Haller
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Instantaneous features of three-dimensional velocity fields are most directly visualized via streamsurfaces. It is generally unclear, however, which streamsurfaces one should pick for this purpose, given that infinitely many such surfaces pass through each point of the flow domain. Exceptions to this rule are vector fields with a nondegenerate first integral whose level surfaces globally define a continuous, one-parameter family of streamsurfaces. While generic vector fields have no first integrals, their vortical regions may admit local first integrals over a discrete set of streamtubes, as Hamiltonian systems are known to do over Cantor sets of invariant tori. Here we introduce a method to construct such first integrals approximately from velocity data, and show that their level sets indeed frame vortical features of the velocity field in examples in which those features are known from Lagrangian analysis. Moreover, we test our method in numerical data sets, including a flow inside a V-junction and a turbulent channel flow. For the latter, we propound an algorithm to pin down the most salient barriers to momentum transport up to a given scale providing a way out of the occlusion conundrum that typically accompanies other vortex visualization methods.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections