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… Expand
Computing Reeb Graphs as a Union of Contour Trees
TLDR
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. Expand
An efficient computation of handle and tunnel loops via Reeb graphs
TLDR
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. Expand
Task-based Augmented Reeb Graphs with Dynamic ST-Trees
TLDR
This paper presents the first parallel algorithm for the computation of the augmented Reeb graph of piecewise linear scalar data, taking 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. Expand
Jacobi Fiber Surfaces for Bivariate Reeb Space Computation
  • J. Tierny, H. Carr
  • Computer Science, Medicine
  • IEEE Transactions on Visualization and Computer Graphics
  • 2017
TLDR
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. Expand
Generalized Topological Simplification of Scalar Fields on Surfaces
TLDR
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. Expand
Avoiding the Global Sort: A Faster Contour Tree Algorithm
TLDR
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. Expand
Task-based Augmented Contour Trees with Fibonacci
This paper presents a new algorithm for the fast, shared memory, multi-core computation of augmented contour trees on triangulations. In contrast to most existing parallel algorithms our techniqueExpand
An Efficient Data Retrieval Parallel Reeb Graph Algorithm
TLDR
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. Expand
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
TLDR
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). Expand
Interactive Quadrangulation with Reeb Atlases and Connectivity Textures
TLDR
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Efficient algorithms for computing Reeb graphs
TLDR
An algorithm that constructs the Reeb graph of a Morse function defined on a 3- manifold in O(nlogn+nlogg(loglogg)^3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. Expand
Contour trees and small seed sets for isosurface traversal
TLDR
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. Expand
Parallel Computation of the Topology of Level Sets
TLDR
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. Expand
Robust on-line computation of Reeb graphs: simplicity and speed
Reeb graphs are a fundamental data structure for understanding and representing the topology of shapes. They are used in computer graphics, solid modeling, and visualization for applications rangingExpand
Reeb graph computation based on a minimal contouring
TLDR
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. Expand
Removing excess topology from isosurfaces
TLDR
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. Expand
Topology-Controlled Volume Rendering
TLDR
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. Expand
Construction of contour trees in 3D in O(n log n) steps
TLDR
An O(n log n) algorithm for computing the contour trees for simplicial meshes with n elements in 3D and an algorithm for “resolution” of singularities of piecewise-linear functions in 2D by subdividing the mesh are outlined. Expand
Topology matching for fully automatic similarity estimation of 3D shapes
TLDR
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. Expand
Loops in Reeb Graphs of 2-Manifolds
TLDR
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. Expand
...
1
2
3
4
...