Author:
Bauer Ulrich,Lange Carsten,Wardetzky Max
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference36 articles.
1. Agarwal, P.K., Arge, L., Yi, K.: I/O-efficient batched union-find and its applications to terrain analysis. In: SCG ’06: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, pp. 167–176. ACM, New York (2006)
2. Attali, D., Glisse, M., Hornus, S., Lazarus, F., Morozov, D.: Persistence-sensitive simplification of functions on surfaces in linear time. Preprint (2008)
3. Banchoff, T.: Critical points and curvature for embedded polyhedra. J. Differ. Geom. 1(3–4), 245–256 (1967)
4. Bauer, U.: Persistence in discrete Morse theory. PhD thesis, University of Göttingen (2011)
5. Chari, M.K.: On discrete Morse functions and combinatorial decompositions. Discrete Math. 217(1–3), 101–113 (2000)
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献