Tree-Based Encoding for Cancellations on Morse Complexes

DOI10.1007/978-3-642-10210-3_26MaRDI QIDQ3651625zbMATH OpenOpenAlexFDO

Authors Lidija Čomić, Leila De Floriani

Publication date 11 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10210-3_26

zbMATH Keywords

Morse theorygraph-based representationMorse complexesaugmented cancellation forestsimplification operators

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract critical point theory (Morse theory, Lyusternik-Shnirel'man theory, etc.) in infinite-dimensional spaces (58E05)

Recommendations

• On encodings of spanning trees
• On binary tree encodements
• On the reconstruction of a Motzkin Tree from its code
• Merge trees in discrete Morse theory
• The realization problem for discrete Morse functions on trees
• Codes Over Trees
• Tree approximation and optimal encoding
• A coding algorithm for Rényi trees
• Towards deterministic tree code constructions

Cited in

(5)

• Cancellation of Critical Points in 2D and 3D Morse and Morse-Smale Complexes
• Merge trees in discrete Morse theory
• Simplification operators on a dimension-independent graph-based representation of Morse complexes
• Maximizing adaptivity in hierarchical topological models using cancellation trees
• Modeling and simplifying Morse complexes in arbitrary dimensions

This page was built for publication: Tree-Based Encoding for Cancellations on Morse Complexes

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