• Corpus ID: 235212110

A Variational Loop Shrinking Analogy for Handle and Tunnel Detection and Reeb Graph Construction on Surfaces

  title={A Variational Loop Shrinking Analogy for Handle and Tunnel Detection and Reeb Graph Construction on Surfaces},
  author={Alexander Weinrauch and Hans-Peter Seidel and Daniel Mlakar and Markus Steinberger and Rhaleb Zayer},
The humble loop shrinking property played a central role in the inception of modern topology but it has been eclipsed by more abstract algebraic formalism. This is particularly true in the context of detecting relevant non- contractible loops on surfaces where elaborate homological and/or graph theoretical constructs are favored in algorithmic solutions. In this work, we devise a variational analogy to the loop shrinking property and show that it yields a simple, intuitive, yet powerful… 



Robust on-line computation of Reeb graphs: simplicity and speed

An on-line algorithm is introduced that reads a stream of elements and continuously maintains the Reeb graph of all elements already reed and is robust in handling non-manifold meshes and general in its applicability to input models of any dimension.

Extended Reeb Graphs for Surface Understanding and Description

An Extended Reeb Graph representation (ERG) is proposed, which can handle degenerate critical points, and an algorithm is presented for its construction.

An efficient computation of handle and tunnel loops via Reeb graphs

This paper uses the concept of the Reeb graph which together with several key theoretical insights on linking number provide an initial set of loops that provably constitute a handle and a tunnel basis and develops a novel strategy to tighten these handle and tunnel basis loops to make them geometrically relevant.

Layered fields for natural tessellations on surfaces

This paper drops the assumption that regions need to be separated by lines and model the partition as a set of smooth functions layered over the surface, which relies mainly on basic linear algebra kernels and lends itself to efficient implementation on modern graphics hardware.

Removing excess topology from isosurfaces

This article presents a practical method for removing handles in an isosurface by making an axis-aligned sweep through the volume to locate handles, compute their sizes, and selectively remove them, and demonstrates topology simplification on several complex models, and shows its benefits for subsequent surface processing.

Efficient algorithms for computing Reeb graphs

On Computing Handle and Tunnel Loops

It is shown that a closed surface of genus g always has g handle and g tunnel loops induced by the embedding and this method is provided with applications to feature detection and topology simplification to show the effectiveness of the method.

Computing geometry-aware handle and tunnel loops in 3D models

The algorithm is a novel application of the concepts from topological persistence introduced recently in computational topology by computing topologically correct loops that are also geometrically relevant.

The Topology ToolKit

An algorithm for the construction of a discrete gradient that complies to the critical points extracted in the piecewise-linear setting is presented, which 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.

Topology matching for fully automatic similarity estimation of 3D shapes

A novel technique is proposed, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs), which operates well as a search key for 3D shape data sets.