Topological segmentation of discrete surfaces

International audienceThis article proposes a new approach to segment a discrete 3-D object into a structure of characteristic topological primitives with attached qualitative features. This structure can be seen itself as a qualitative description of the object, because : - it is intrinsic to the 3-D object, which means it is stable to rigid transformations (rotations and translations); - it is locally defined, and therefore stable to partial occlusions and local modifications of the object structure; - it is robust to noise and small deformations, as confirmed by our experimental results. Our approach concentrates on topological properties of discrete surfaces. These surfaces may correspond to the external surface of the objects extracted by a 3-D edge detector, or to the skeleton surface obtained by a new thinning algorithm. Our labeling algorithm is based on very local computations, allowing massively parallel computations and real-time computations. An indirect result of these topological properties is a new characterization of simple points. We present a realistic experiment to characterize and locate spatially a complex 3-D medical object using the proposed segmentation of its skeleton

The Topology ToolKit

This system paper presents the Topology ToolKit (TTK), a software platform designed for topological data analysis in scientific visualization. TTK provides a unified, generic, efficient, and robust implementation of key algorithms for the topological analysis of scalar data, including: critical points, integral lines, persistence diagrams, persistence curves, merge trees, contour trees, Morse-Smale complexes, fiber surfaces, continuous scatterplots, Jacobi sets, Reeb spaces, and more. TTK is easily accessible to end users due to a tight integration with ParaView. It is also easily accessible to developers through a variety of bindings (Python, VTK/C++) for fast prototyping or through direct, dependence-free, C++, to ease integration into pre-existing complex systems. While developing TTK, we faced several algorithmic and software engineering challenges, which we document in this paper. In particular, we present an algorithm for the construction of a discrete gradient that complies to the critical points extracted in the piecewise-linear setting. This algorithm guarantees a combinatorial consistency across the topological abstractions supported by TTK, and importantly, a unified implementation of topological data simplification for multi-scale exploration and analysis. We also present a cached triangulation data structure, that supports time efficient and generic traversals, which self-adjusts its memory usage on demand for input simplicial meshes and which implicitly emulates a triangulation for regular grids with no memory overhead. Finally, we describe an original software architecture, which guarantees memory efficient and direct accesses to TTK features, while still allowing for researchers powerful and easy bindings and extensions. TTK is open source (BSD license) and its code, online documentation and video tutorials are available on TTK's website

Combinatorial Gradient Fields for 2D Images with Empirically Convergent Separatrices

This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost surely to its continuous counterpart when the image resolution is increased. This approach is motivated using basic ideas from probability theory and builds upon an algorithm from discrete Morse theory with a strong mathematical foundation. While a formal proof is only hinted at, we do provide a thorough numerical evaluation of our method and compare it to established algorithms.Comment: 17 pages, 7 figure

Discrete curvature approximations and segmentation of polyhedral surfaces

The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object. To this end, discrete curvature approximations are introduced as the basis of a segmentation process that lead to a decomposition of digitized data into areas that will help the construction of parametric surface patches. The approach proposed relies on the use of a polyhedral representation of the object built from the digitized data input. Then, it is shown how noise reduction, edge swapping techniques and adapted remeshing schemes can participate to different preparation phases to provide a geometry that highlights useful characteristics for the segmentation process. The segmentation process is performed with various approximations of discrete curvatures evaluated on the polyhedron produced during the preparation phases. The segmentation process proposed involves two phases: the identification of characteristic polygonal lines and the identification of polyhedral areas useful for a patch construction process. Discrete curvature criteria are adapted to each phase and the concept of invariant evaluation of curvatures is introduced to generate criteria that are constant over equivalent meshes. A description of the segmentation procedure is provided together with examples of results for free form object surfaces

The Spine of the Cosmic Web

We present the SpineWeb framework for the topological analysis of the Cosmic Web and the identification of its walls, filaments and cluster nodes. Based on the watershed segmentation of the cosmic density field, the SpineWeb method invokes the local adjacency properties of the boundaries between the watershed basins to trace the critical points in the density field and the separatrices defined by them. The separatrices are classified into walls and the spine, the network of filaments and nodes in the matter distribution. Testing the method with a heuristic Voronoi model yields outstanding results. Following the discussion of the test results, we apply the SpineWeb method to a set of cosmological N-body simulations. The latter illustrates the potential for studying the structure and dynamics of the Cosmic Web.Comment: Accepted for publication HIGH-RES version: http://skysrv.pha.jhu.edu/~miguel/SpineWeb