Robust computations of Reeb graphs in 2-D binary images

DOI10.1007/978-3-319-39441-1_19MaRDI QIDQ2815197zbMATH OpenOpenAlexFDO

Authors Antoine Vacavant, Aurélie Leborgne

Publication date 27 June 2016

Published in Computational Topology in Image Context (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-39441-1_19

zbMATH Keywords

Reeb graphskeletonizationtopology

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55)

Recommendations

• Reeb graphs through local binary patterns
• Reeb graphs for shape analysis and applications
• Note on an algorithm for computing the Reeb graph
• Efficient Output-Sensitive Construction of Reeb Graphs
• Efficient algorithms for computing Reeb graphs

Cites work

• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• scientific article; zbMATH DE number 3106699 (Why is no real title available?)
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• Reeb graph based segmentation of articulated components of 3D digital objects
• Reeb graphs for shape analysis and applications
• Separable distance transformation and its applications

Cited in

(4)

• Topological analysis of voxelized objects by discrete geodesic Reeb graph
• The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs
• Reeb graph based segmentation of articulated components of 3D digital objects
• Reeb graphs through local binary patterns

This page was built for publication: Robust computations of Reeb graphs in 2-D binary images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815197)