๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 2012 symposuim - Chapel Hill, North Carolina, USA (2012.06.17-2012.06.20)] Proceedings of the 2012 symposuim on Computational Geometry - SoCG '12 - A deterministic o(m log m) time algorithm for the reeb graph

โœ Scribed by Parsa, Salman


Book ID
121425298
Publisher
ACM Press
Year
2012
Weight
895 KB
Category
Article
ISBN
1450312993

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[ACM Press the 2012 symposuim - Chapel H
โœ Parsa, Salman ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› ACM Press ๐ŸŒ English โš– 895 KB

We present a deterministic algorithm to compute the Reeb graph of a PL real-valued function on a simplicial complex in O(m log m) time, where m is the size of the 2-skeleton. The problem reduces to dynamic graph connectivity. We obtain the running time by using offline graph connectivity which assum