Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Geometric Localization of Homology Cycles
Amritendu Dhar, Vijay Natarajan, Abhishek Rathod
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is cur…
cs.CG2021
Fast Algorithms for Minimum Homology Basis
Amritendu Dhar, Vijay Natarajan, Abhishek Rathod
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the -dimensional homology classes with coefficients in…