Robust Computations of Reeb Graphs in 2-D Binary Images
From MaRDI portal
Publication:2815197
DOI10.1007/978-3-319-39441-1_19zbMath1339.68295OpenAlexW2478006476MaRDI QIDQ2815197
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
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Biomedical imaging and signal processing (92C55)
Cites Work
- Unnamed Item
- Reeb graph based segmentation of articulated components of 3D digital objects
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Reeb graphs for shape analysis and applications
- Separable Distance Transformation and Its Applications
- A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
This page was built for publication: Robust Computations of Reeb Graphs in 2-D Binary Images