Efficient algorithms for computing Reeb graphs
type: Item
instance of: scholarly article
title: Efficient algorithms for computing Reeb graphs
zbMATH Open document ID: 1182.05117
author: Harish Doraiswamy
author: Vijay Natarajan
published in: Computational Geometry
publication date: 2009-07-27T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5587033
zbMATH Keywords: computational topology
zbMATH Keywords: algorithms
zbMATH Keywords: dynamic graph
zbMATH Keywords: level set
zbMATH Keywords: manifold
zbMATH Keywords: piecewise-linear function
zbMATH Keywords: Reeb graph
describes a project that uses: Tulip
MaRDI profile type: Publication
full work available at URL: j.comgeo.2008.12.003
OpenAlex ID: W2011751494
cites work: Critical Points and Curvature for Embedded Polyhedral Surfaces
cites work: Biased Search Trees
cites work: Computing contour trees in all dimensions
cites work: Loops in Reeb graphs of 2-manifolds
cites work: Introduction to algorithms
cites work: Morse-smale complexes for piecewise linear 3-manifolds
cites work: Q4471349
cites work: Maintenance of a minimum spanning forest in a dynamic plane graph
cites work: Topological quadrangulations of closed triangulated surfaces using the Reeb graph
cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
cites work: Parallel computation of the topology of level sets
cites work: Q5845505
cites work: A data structure for dynamic trees
cites work: Near-optimal fully-dynamic graph connectivity
DOI: 10.1016/J.COMGEO.2008.12.003
description: scientific article; zbMATH DE number 5587033