# Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees

@article{Tierny2009LoopSF, title={Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees}, author={Julien Tierny and Attila Gyulassy and Eddie Simon and Valerio Pascucci}, journal={IEEE Transactions on Visualization and Computer Graphics}, year={2009}, volume={15}, pages={1177-1184} }

This paper introduces an efficient algorithm for computing the Reeb graph of a scalar function f defined on a volumetric mesh M in Ropf3. We introduce a procedure called "loop surgery" that transforms M into a mesh M' by a sequence of cuts and guarantees the Reeb graph of f(M') to be loop free. Therefore, loop surgery reduces Reeb graph computation to the simpler problem of computing a contour tree, for which well-known algorithms exist that are theoretically efficient (O(n log n)) and fast in…

## Figures and Tables from this paper

## 83 Citations

### Computing Reeb Graphs as a Union of Contour Trees

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2013

A fast algorithm to compute the Reeb graph of a piecewise-linear (PL) function defined over manifolds and non-manifolds that outperforms current generic algorithms by a factor of up to two orders of magnitude, and has a performance on par with algorithms that are catered to restricted classes of input.

### An efficient computation of handle and tunnel loops via Reeb graphs

- Computer ScienceACM Trans. Graph.
- 2013

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.

### Task-based Augmented Reeb Graphs with Dynamic ST-Trees

- Computer ScienceEGPGV@EuroVis
- 2019

This paper presents the first parallel algorithm for the computation of the augmented Reeb graph of piecewise linear scalar data, and takes advantage of Fibonacci heaps to exploit the ST-Tree data structure through independent local propagations, while maintaining the optimal, linearithmic time complexity of the sequential reference algorithm.

### Jacobi Fiber Surfaces for Bivariate Reeb Space Computation

- Computer Science, MathematicsIEEE Transactions on Visualization and Computer Graphics
- 2017

The first practical, output-sensitive algorithm for the exact computation of such a Reeb space of an input bivariate piecewise linear scalar function f defined on a tetrahedral mesh is reported, enabling for the first time the tractable computation of bivariate Reeb spaces in practice.

### Generalized Topological Simplification of Scalar Fields on Surfaces

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2012

A combinatorial algorithm for the general topological simplification of scalar fields on surfaces that enables the robust pruning of topological noise as selected by the user and is simple to implement, fast in practice and more general than previous techniques.

### Avoiding the Global Sort: A Faster Contour Tree Algorithm

- Computer ScienceDiscret. Comput. Geom.
- 2017

The first algorithm whose time complexity depends on the contour tree structure, and avoids the global sort for non-pathological inputs is presented, allowing for strong optimality properties of the algorithm.

### Task-based Augmented Contour Trees with Fibonacci

- Computer Science
- 2019

This paper presents a new algorithm for the fast, shared memory, multi-core computation of augmented contour trees on triangulations, which completely revisits the traditional, sequential contour tree algorithm to re-formulate all the steps of the computation as a set of independent local tasks.

### An Efficient Data Retrieval Parallel Reeb Graph Algorithm

- Computer ScienceAlgorithms
- 2020

A parallel Reebgraph algorithm on triangulated meshes with and without a boundary is proposed and a description for extracting the original manifold data from the Reeb graph structure is given.

### A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes

- Computer Science, MathematicsSCG
- 2010

This paper presents the first sub-quadratic algorithm to compute the Reeb graph for a function on an arbitrary simplicial complex K, and is faster than current algorithms for any other special cases (e.g, 3-manifolds).

### Interactive Quadrangulation with Reeb Atlases and Connectivity Textures

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2012

This work presents a new framework, following a coarse to fine design philosophy, which allows for explicit control of the subjective quality criteria on the output quad mesh, at interactive rates, by combining scalar field topology and combinatorial connectivity techniques.

## References

SHOWING 1-10 OF 30 REFERENCES

### Contour trees and small seed sets for isosurface traversal

- Computer ScienceSCG '97
- 1997

This paper gives the first methods to obtain seed sets that are provably small in size based on a variant of the contour tree (or topographic change tree), and develops a simple approximation algorithm giving a seed set of size at most twice the size of the minimum once the contours tree is known.

### Parallel Computation of the Topology of Level Sets

- Computer ScienceAlgorithmica
- 2003

This paper introduces two efficient algorithms that compute the Contour Tree of a three-dimensional scalar field F and its augmented version with the Betti numbers of each isosurface and a new divide-and-conquer algorithm that computes the Augmented Contour tree with improved efficiency.

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

- Computer ScienceACM Trans. Graph.
- 2007

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.

### Reeb graph computation based on a minimal contouring

- Computer Science2008 IEEE International Conference on Shape Modeling and Applications
- 2008

This work proposes a novel computation of the Reeb graph that is based on the analysis of the iso-contours solely at saddle points and takes O(sn)-time, where n is the number of vertices of the triangulation of M and s is thenumber of saddles of f.

### Removing excess topology from isosurfaces

- Computer ScienceTOGS
- 2004

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.

### Topology-Controlled Volume Rendering

- Computer ScienceIEEE Transactions on Visualization and Computer Graphics
- 2007

A framework for direct volume rendering based on segmenting a volume into regions of equivalent contour topology and applying separate transfer functions to each region and a unique transfer function can be assigned to each subvolume corresponding to a branch of the contour tree.

### Topology matching for fully automatic similarity estimation of 3D shapes

- Computer ScienceSIGGRAPH
- 2001

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.

### Loops in Reeb Graphs of 2-Manifolds

- Mathematics, Computer ScienceSCG '03
- 2003

Tight upper and lower bounds are proved on the number of loops in the Reeb graph that depend on the genus, number of boundary components, and whether or not the 2-manifold is orientable.

### Extended Reeb Graphs for Surface Understanding and Description

- Computer ScienceDGCI
- 2000

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