36 citations · 177 across the 35 of their papers we have counts for
Showing 2013 · cs.CGShow all
3 papers · 2 filters
cs.CG2013
Book embeddings of Reeb graphs
Vitaliy Kurlin
Let be a simplicial complex with a piecewise linear function . The Reeb graph is the quotient of , where we collapse each connected component o…
cs.CG2013
Approximating persistent homology for a cloud of points in a subquadratic time
Vitaliy Kurlin
The Vietoris-Rips filtration for an -point metric space is a sequence of large simplicial complexes adding a topological structure to the otherwise disconnected space. The persi…
cs.CG2013★ 15 cited
A fast and robust algorithm to count topologically persistent holes in noisy clouds
Vitaliy Kurlin
Preprocessing a 2D image often produces a noisy cloud of interest points. We study the problem of counting holes in unorganized clouds in the plane. The holes in a given cloud are…