The JS-graphs of join and split trees (extended abstract)

DOI10.1145/2582112.2582162zbMATH Open1395.68317OpenAlexW2080596514MaRDI QIDQ4635581FDOQ4635581

Authors: Suyi Wang, Yusu Wang, Rephael Wenger 

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582162

Recommendations

• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
• Constructing Reeb graphs using cylinder maps
• Reeb graphs: approximation and persistence
• Efficient algorithms for computing Reeb graphs
• Reeb graphs, approximation and persistence

zbMATH Keywords

Reeb graphcontour treesplit treejoin tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continuous maps (54C05)

Cited In (2)

• A categorical approach to contour, split and join trees with application to airway segmentation
• Labeled interleaving distance for Reeb graphs

This page was built for publication: The JS-graphs of join and split trees (extended abstract)

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