A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Algorithms Converting Streamline Topologies for 2D Hamiltonian Vector Fields Using Reeb Graphs and Persistent Homology
Nihon Oyo Suri Gakkai ronbunshi
Sakajo and Yokoyama have shown that any streamline topology for a 2D Hamiltonian vector field is uniquely represented by a sequence of letters. Although a conversion algorithm has been provided conceptually in these papers, its real implementation is difficult, since we need to identify a component of streamline topologies visually. In this paper, we realize a new procedure implementable to the conversion algorithm on computers through Reeb graph representations of Hamiltonian functions anddoi:10.11540/jsiamt.29.2_187 fatcat:4b46527zyffoxbgtixdkgnqfvm