Hierarchical Forman Triangulation: A multiscale model for scalar field analysis

Abstract We consider the problem of analyzing the topology of scalar fields defined on a triangulated shape by using a multi-scale approach, which allows reducing storage costs and computation times, and supports interactive inspection and classification of topological features. We define and implement a multi-scale model that we call a Hierarchical Forman Triangulation (HFT) , where a 3D shape or a terrain is discretized as a triangle mesh, and its topology is described by defining a discrete Morse gradient field based on function values given at the vertices of the mesh. We introduce a new edge contraction operator, which does not change the behavior of the gradient flow and does not create new critical points, and we apply it in combination with a topological simplification operator which eliminates critical elements in pair. By combining the two operators in a sequence, we generate the HFT . We discuss and implement a compact encoding for the HFT that has a lower storage cost with respect to the triangle mesh at full resolution. We show the effectiveness of this new hierarchical model by extracting representations of terrains and shapes endowed with a scalar field at different, uniform and variable, scales and by efficiently computing topological features and segmentations.

[1]  Valerio Pascucci,et al.  Spectral surface quadrangulation , 2006, SIGGRAPH 2006.

[2]  Yukio Matsumoto.  An Introduction to Morse Theory , 2001 .

[3]  Leila De Floriani,et al.  Morse complexes for shape segmentation and homological analysis: discrete models and algorithms , 2015, Comput. Graph. Forum.

[4]  Bert Jüttler,et al.  Geometric Modeling and Processing , 2009, Comput. Aided Geom. Des..

[5]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[6]  Afra Zomorodian,et al.  Localized Homology , 2007, IEEE International Conference on Shape Modeling and Applications 2007 (SMI '07).

[7]  Emanuele Danovaro,et al.  Multiresolution morse triangulations , 2010, SPM '10.

[8]  Valerio Pascucci,et al.  Generalized Topological Simplification of Scalar Fields on Surfaces , 2012, IEEE Transactions on Visualization and Computer Graphics.

[9]  Herbert Edelsbrunner,et al.  Hierarchical morse complexes for piecewise linear 2-manifolds , 2001, SCG '01.

[10]  Jovan Popovic,et al.  Progressive simplicial complexes , 1997, SIGGRAPH.

[11]  Tamal K. Dey,et al.  Shape Segmentation and Matching with Flow Discretization , 2003, WADS.

[12]  Leila De Floriani,et al.  A combined geometrical and topological simplification hierarchy for terrain analysis , 2014, SIGSPATIAL/GIS.

[13]  Hans-Peter Seidel,et al.  Fast and Memory-Efficienty Topological Denoising of 2D and 3D Scalar Fields , 2014, IEEE Transactions on Visualization and Computer Graphics.

[14]  Olga Sorkine-Hornung,et al.  Topology‐based Smoothing of 2D Scalar Fields with C1‐Continuity , 2010, Comput. Graph. Forum.

[15]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[16]  Bernd Hamann,et al.  A topological approach to simplification of three-dimensional scalar functions , 2006, IEEE Transactions on Visualization and Computer Graphics.

[17]  Bernd Hamann,et al.  A topological hierarchy for functions on triangulated surfaces , 2004, IEEE Transactions on Visualization and Computer Graphics.

[18]  Leila De Floriani,et al.  Simplifying morphological representations of 2D and 3D scalar fields , 2011, GIS.

[19]  Daniele Panozzo,et al.  Practical quad mesh simplification , 2010, Comput. Graph. Forum.

[20]  T. Banchoff.  Critical Points and Curvature for Embedded Polyhedral Surfaces , 1970 .

[21]  Georges-Pierre Bonneau,et al.  Piecewise Polynomial Reconstruction of Functions from Simplified Morse-Smale complex , 2014 .

[22]  Chao Chen,et al.  Optree: A Learning-Based Adaptive Watershed Algorithm for Neuron Segmentation , 2014, MICCAI.

[23]  Leila De Floriani,et al.  Selective refinement queries for volume visualization of unstructured tetrahedral meshes , 2004, IEEE Transactions on Visualization and Computer Graphics.

[24]  Leila De Floriani,et al.  IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions , 2011, Comput. Graph..

[25]  Leila De Floriani,et al.  Efficient computation and simplification of discrete morse decompositions on triangulated terrains , 2014, SIGSPATIAL/GIS.

[26]  Peter John Wood,et al.  Ieee Transactions on Pattern Analysis and Machine Intelligence Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images , 2022 .

[27]  Leila De Floriani,et al.  Dimension-independent multi-resolution Morse complexes , 2012, Comput. Graph..

[28]  Hujun Bao,et al.  Feature correspondences using Morse Smale complex , 2012, The Visual Computer.

[29]  Max K. Agoston,et al.  Computer graphics and geometric modelling - implementation and algorithms , 2005 .

[30]  Serge Beucher,et al.  Watershed, Hierarchical Segmentation and Waterfall Algorithm , 1994, ISMM.

[31]  Herbert Edelsbrunner,et al.  Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[32]  Hans Hagen,et al.  Direct Feature Visualization Using Morse-Smale Complexes , 2012, IEEE Transactions on Visualization and Computer Graphics.

[33]  Bernd Hamann,et al.  Maximizing Adaptivity in Hierarchical Topological Models Using Cancellation Trees , 2009, Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration.

[34]  Hans Hagen,et al.  A Survey of Topology‐based Methods in Visualization , 2016, Comput. Graph. Forum.

[35]  Leila De Floriani,et al.  Morphologically-aware elimination of flat edges from a TIN , 2013, SIGSPATIAL/GIS.