| Summary: | In this paper, we present an algorithm to compute the filtered generalized Čech complex for a finite collection of disks in the plane, which do not necessarily have the same radius. The key step behind the algorithm is to calculate the minimum scale factor needed to ensure rescaled disks have a nonempty intersection, through a numerical approach, whose convergence is guaranteed by a generalization of the well-known Vietoris−Rips Lemma, which we also prove in an alternative way, using elementary geometric arguments. We give an algorithm for computing the 2-dimensional filtered generalized Čech complex of a finite collection of <i>d</i>-dimensional disks in <inline-formula> <math display="inline"> <semantics> <msup> <mi mathvariant="double-struck">R</mi> <mi>d</mi> </msup> </semantics> </math> </inline-formula>, and we show the performance of our algorithm.
|
|---|