Showing cs.CGShow all
2 papers · 1 filter
cs.CG2021
On Complexity of Computing Bottleneck and Lexicographic Optimal Cycles in a Homology Class
Erin Wolf Chambers, Salman Parsa, Hannah Schreiber
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in…
cs.CG2018
Discrete Morse Theory for Computing Zigzag Persistence
Clément Maria, Hannah Schreiber
We introduce a theoretical and computational framework to use discrete Morse theory as an efficient preprocessing in order to compute zigzag persistent homology. From a zigzag filt…