Note on an algorithm for computing the Reeb graph

MaRDI QIDQ5376196zbMATH OpenFDO

Authors Adela Lupescu

Publication date 17 September 2018

Full work available at URL https://ijgeometry.com/wp-content/uploads/2017/07/10.pdf

zbMATH Keywords

computational topologycritical pointReeb graph

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to global analysis (58-04) Abstract critical point theory (Morse theory, Lyusternik-Shnirel'man theory, etc.) in infinite-dimensional spaces (58E05)

Recommendations

• Efficient algorithms for computing Reeb graphs
• Constructing Reeb graphs using cylinder maps
• Reeb graphs: approximation and persistence
• Reeb graphs of piecewise linear functions
• Reeb graphs, approximation and persistence

Cited in

(17)

• Reeb graphs: approximation and persistence
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
• Robust computations of Reeb graphs in 2-D binary images
• A deterministic O(m m) time algorithm for the Reeb graph
• Efficient Output-Sensitive Construction of Reeb Graphs
• Reeb spaces of piecewise linear mappings
• TOPOLOGY-GUIDED TESSELLATION OF QUADRATIC ElEMENTS
• scientific article; zbMATH DE number 177656 (Why is no real title available?)
• scientific article; zbMATH DE number 2079726 (Why is no real title available?)
• Reeb graphs of piecewise linear functions
• An efficient computation of handle and tunnel loops via Reeb graphs
• Reeb graphs, approximation and persistence
• Constructing Reeb graphs using cylinder maps
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• Tessellation of Quadratic Elements
• Poincar\'e-Reeb graphs of real algebraic domains
• Efficient algorithms for computing Reeb graphs

This page was built for publication: Note on an algorithm for computing the Reeb graph

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