8 citations · 8 across the 3 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2019
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", Theoretical Computer Science 769 (2019) 63--74
Sanjib Sadhu, Xiaozhou He, Sasanka Roy +2
In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is propos…
cs.CG2018★ 8 cited
Approximate Nearest Neighbors in the Space of Persistence Diagrams
Brittany Terese Fasy, Xiaozhou He, Zhihui Liu +3
Persistence diagrams are important tools in the field of topological data analysis that describe the presence and magnitude of features in a filtered topological space. However, cu…