Measuring the Error in Approximating the Sub-Level Set Topology of Sampled Scalar Data

Abstract

This paper studies the influence of the definition of neighborhoods and methods used for creating point connectivity on topological analysis of scalar functions. It is assumed that a scalar function is known only at a finite set of points with associated function values. In order to utilize topological approaches to analyze the scalar-valued point set, it is necessary to choose point neighborhoods and, usually, point connectivity to meaningfully determine critical-point behavior for the point set. Two distances are used to measure the difference in topology when different point neighborhoods and means to define connectivity are used: (i) the bottleneck distance for persistence diagrams and (ii) the distance between merge trees. Usually, these distances define how different scalar functions are with respect to their topology. These measures, when properly adapted to point sets coupled with a definition of neighborhood and connectivity, make it possible to understand how topological characteristics depend on connectivity. Noise is another aspect considered. Five types of neighborhoods and connectivity are discussed: (i) the Delaunay triangulation; (ii) the relative neighborhood graph; (iii) the Gabriel graph; (iv) the [Formula: see text]-nearest-neighbor (KNN) neighborhood; and (v) the Vietoris–Rips complex. It is discussed in detail how topological characterizations depend on the chosen connectivity.

A new construction for sublevel set persistence

“…The higher dimensional case has been studied using the Morse-Smale complex [11] in the context of grayscale images, which has also been applied to topics such as energy landscapes in particle systems [14]. For other applications and references, see also [1,2,3,4,5,10,22].…”