2024/09/09 by Son Le Thanh, Thanh, Son Le, Michael Ankele +3
Computer Science · Mathematics · #Computational Geometry (cs.CG) #Digital Image Processing Techniques #FOS: Computer and information sciences #Homotopy and Cohomology in Algebraic Topology #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2409.05532
openalex publication_date 2024/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Morse-Smale complex is a standard tool in visual data analysis. The classic definition is based on a continuous view of the gradient of a scalar function where its zeros are the critical points. These points are connected via gradient curves and surfaces emanating from saddle points, known as separatrices. In a discrete setting, the Morse-Smale complex is commonly extracted by constructing a combinatorial gradient assuming the steepest descent direction. Previous works have shown that this method results in a geometric embedding of the separatrices that can be fundamentally different from those in the continuous case. To achieve a similar embedding, different approaches for constructing a combinatorial gradient were proposed. In this paper, we show that these approaches generate a different topology, i.e., the connectivity between critical points changes. Additionally, we demonstrate that the steepest descent method can compute topologically and geometrically accurate Morse-Smale complexes when applied to certain types of grids. Based on these observations, we suggest a method to attain both geometric and topological accuracy for the Morse-Smale complex of data sampled on a uniform grid.