Avoiding the global sort: a faster contour tree algorithm

DOI10.1007/s00454-017-9901-zzbMath1387.68274arXiv1411.2689OpenAlexW2215070680MaRDI QIDQ1688860

Benjamin Raichel, C. Seshadhri

Publication date: 11 January 2018

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.2689

zbMATH Keywords

computational geometrycomputational topologycontour trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Correction to: ``Avoiding the global sort: a faster contour tree algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Efficient algorithms for computing Reeb graphs
• A data structure for dynamic trees
• Computing contour trees in all dimensions
• A deterministic o(m log m) time algorithm for the reeb graph
• A data structure for manipulating priority queues
• Loops in reeb graphs of 2-manifolds
• A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes