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 d-dimensional disks in , and we show the performance of our algorithm.
disk system; generalized Čech complex; Čech scale; generalized Vietoris–Rips Lemma; miniball problem
68U05; 55U05; 68W40; 65D18
Recently, in the study of data point clouds from a topological approach (cf. [1,2,3,4,5]), the need to develop algorithms to construct different simplicial structures has arisen, such as the Vietoris–Rips complex, the Čech complex, the piecewise linear lower star complex, etc. (cf. [6,7]).
Of particular interest to us is the generalized Čech complex structure, whereas the standard Čech complex is induced by the intersection of a collection of disks with fixed radius, the generalized version admits different radii (see ); when radii are rescaled, using the same scale factor each time, the corresponding simplicial complexes forms the filtered generalized Čech complex.
There exist efficient algorithms to calculate the standard Čech complex (see, e.g., in ), and software currently available to obtain the associated filtration (cf. [10,11]); also, in  the authors propose an algorithm to approximate the Čech filtration. On the other hand, we can find algorithms to calculate the generalized Čech complex (see, e.g., in ); however, as far as we know, there are neither algorithms nor software to provide the filtered generalized Čech complex. In the present work, we show an algorithm to compute the filtered generalized Čech complex for a finite collection of disks, specifically, in the plane. Actually, we also show an algorithm to build up to the 2-dimensional filtered generalized structure (or 2-skeleton), for higher-dimensional disk systems, which many applications only require, as we can see in [13,14,15,16,17].
The key step behind these proposed algorithms, is to calculate the minimum scale factor (called Čech scale) needed to ensure that the rescaled disks have a nonempty intersection; the generalized Vietoris–Rips lemma over multiple radii will allow us to calculate these scales numerically.
We must emphasize that our main algorithm (Algorithm 3) is only generalizable to higher-dimensional disk systems to obtain the 2-dimensional filtered generalized Čech structure, as we show as an application. Additionally, we show how our algorithm yields the minimal enclosing ball for a finite set of points in the plane.
This paper is organized as follows. In Section 2, we introduce basic notions and notation which will be used throughout the paper. We define the Vietoris–Rips system and the Čech system, associated to a finite collection of closed disks in the euclidean space (or disk system) in terms of their intersection. We also introduce the fundamental notions of Vietoris–Rips scale and Čech scale for a disk system, as the infimum over all rescaling factors such that the disk system becomes a Vietoris–Rips system or a Čech system, respectively. In Lemma 2, we state and prove a generalization, over multiple radii, of the well-known Vietoris–Rips Lemma  (Theorem 2.5) using elementary geometric arguments. In  there is a proof in the generalized case, following the ideas in .
In Section 3 we describe the generalized versions of standard Vietoris–Rips and Čech simplicial complex structures, to the case of disk systems with different radii. We explain how their respective filtrations are induced by weight functions, and we propose an algorithm to obtain the Čech-weight function of a given disk system, associating to each Čech simplex its corresponding Čech scale.
Section 4 focuses on studying the intersection properties of collections of disks in the plane. We define a real-valuated function associated to each disk system in the plane, such that, if it turns out to be non-negative, then its Čech scale agrees with its Vietoris–Rips scale, being then easy to compute; otherwise, the Čech scale will correspond to a root of such function, and we propose a numerical approach to obtain this Čech scale (Section 5), supported on the generalized Vietoris–Rips Lemma which provides appropriated bounds.
Section 5 contains our main result, the Cech.scale algorithm, whose input is a disk system in the plane, and the output is the corresponding Čech scale, as well as the unique intersection point of the rescaled disk system at its Čech scale (see Lemma 1). We show as a example the miniball problem, to show how our Cech.scale algorithm yields the minimal enclosing ball for a finite point cloud in the plane.
Finally, we conclude the paper illustrating in Section 6 an algorithm for computing the Čech filtration of the 2-skeleton of the generalized Čech complex structure for a d-dimensional disk systems in an arbitrary euclidean space .
2. Vietoris–Rips and Čech systems
Throughout this paper, a finite collection of closed d-disks in the euclidean space , with positive radius,
will be called d-disk system, or simply disk system when there is no risk of confusion. In this section, we introduce and analyze two fundamental subclasses of disk systems, namely, the Vietoris–Rips systems and the Čech systems. We study the infimum of those scales that turn a disk system into a Vietoris–Rips or Čech system. We conclude this section presenting a generalized version of the Vietoris–Rips Lemma, extended to disk systems.
Let be a disk system. We say M is a Vietoris–Rips system if for each pair . Moreover, if the disk system M has the nonempty intersection property , then M is called a Čech system.
For each , and disk system M as in (1) we define the collection
and say that is a scale. Geometrically, the set consists of disks with the same centers than those in M, but with rescaled radii by . Clearly, only when the set will be again a disk system. Note that , and is the set consisting of the centers of the disks in M.
Let M be a disk system. The Vietoris–Rips scale of M is defined by,
Analogously, the Čech scale of M is defined by,
Let be the Čech scale of the disk system M, then we have that . Essentialy, this is a consequence of the completeness of the euclidean space, the fact that is a closed subset for every scale in the set and for .
A straightforward calculation shows the following characterizations. M is a Vietoris–Rips system if and only if, (in particular, ); similarly, M is a Čech system if and only if, .
Note that it is easy to calculate the Vietoris–Rips scale for a given disk system : if denotes the radius of , and represents the distance between the center of and , then .
For a disk system M with just one disk, its Vietoris–Rips scale is ; if has two disks, then . Actually, in both cases the Vietoris–Rips scale agrees with the Čech scale.
On the other hand, calculating the Čech scale is a more complicated issue if the disk system has at least three disks. Concerning to Čech scales, we have the following lemma, which will become important for our implementations.
Let be a scale and let M be a disk system. Then, μ is the Čech scale of M if and only if, the μ-rescaled system has only one intersection point, i.e., the set is unitary.
Such point in will be denoted by .
The case happens only when the disk system consists of a single disk or is a collection of concentric disks. In this case, the claim of the lemma is evident.
Let be the Čech scale of M and suppose there exist a couple of points such that . By convexity of the disks, it follows that the middle point must belong to every disk . On the other hand, for any center in the disk system. Let be a scale such that for every disk in M. It follows that and which contradicts the minimality of the Čech scale . Therefore, the set is unitary.
Now, suppose is unitary and consider the set .
If , then for some , because otherwise there would exist a neighborhood of p entirely contained in .
The fact that is a consequence of the following.
Let be a scale such that . If , then for any , and ; thus, and ; therefore, . Then, , for any .
For every , we have . Then, , i.e., .
Figure 1 shows (left picture) the following disk system in ,
This 2-disk system is a Vietoris–Rips system and also a Čech system. In this case, we have , and, in actuality, the -rescaled 2-disk system (center picture) has an empty intersection, i.e., , so it corresponds to a Vietoris Rips system which is not a Čech system. For such 2-disk system, theCech.scalealgorithm in Section 5 yields to and the Čech system is shown in the right picture.
There exists a close relationship between Vietoris–Rips systems and Čech systems. Obviously, every Čech system is also a Vietoris–Rips system, but the opposite statement does not hold in general (as we saw in the example above). However, we have the following result which extends the standard Vietoris–Rips Lemma (, Theorem 2.5), to any Vietoris–Rips system; such result can be found in (, Theorem 3.2) in the context of weighted simplicial complexes.
The standard Vietoris–Rips Lemma is established in the context of a disk system in which all radii are equal, and corresponds to a reformulation of the well-known Jung’s Lemma . On the other hand, for a disk system in general, the Vietoris–Rips Lemma is also valid, although it does not follow directly from Jung’s Lemma. Next, we propose a proof of the Vietoris–Rips Lemma, for an arbitrary disk system, using elementary geometrical arguments.
Let be a finite set of closed disks in . If for every pair of disks in M, then
In other words, for every Vietoris–Rips system M in , the -rescaled disk system is a Čech system.
First, we prove the result for the case where M has at most disks, say , . Note that we need to prove that .
Let be the unique intersection point of the -rescaled disk system (see Lemma 1). Without loss of generality, we assume that for and .
Then, belongs to the convex hull of the set , for if this were not true, there would exist an hyperplane across such that the set is completely contained at one side, let v be the normal vector for such hyperplane in the opposite direction, then for all , therefore
for every ; this implies that for any and , which is a contradiction since is the only point in the intersection . Therefore, is in the convex hull.
Now, define and let denote the angle between vectors and . As is in the convex hull of , then the vector can be written as a convex combination . Thus, for any , and
Taking out the common factor , we have . Now, taking the sum over i, we deduce that
Note that . On the other hand, if were for all , , then for each j we should have . However, this contradicts (2) because and . Therefore, there must exist , say and , such that , then
It follows from inequality above and from the AM-GM inequality, that
A straightforward calculation on (4) leads us to the following inequality
(the last inequality holds because M is a Vietoris–Rips system) or equivalently .
For a collection with more than disks, the claim of the lemma is a consequence of the Helly’s Theorem (see , Problem 29), which establishes that for any finite collection, with at least convex subsets of the d-dimensional euclidean space , if the intersection of every subcolection with of such sets is nonempty, then the whole collection has a nonempty intersection. This concludes the proof. □
The upper bound in Lemma 2 is optimal: it suffices to take a disk system with disks of equal radii and pairwise tangents (cf. , Section III.2).
In the Example 1 we can see what the Vietoris–Rips Lemma claim for the 2-disk system M: .
To conclude this section, notice that as for a Čech system , then the Vietoris–Rips Lemma implies the following result.
If M is an arbitrary d-disk system and is its Vietoris–Rips scale, then its Čech scale satisfies that . In consequence, for every d-disk system M, the rescaled disk system is always a Čech system.
In particular, if then is a Čech system.
3. Filtered Generalized Simplicial Structures for Disk Systems
In this section, we introduce two simplicial structures associated with a disk system M, as well as the filtration induced by rescaling the system M. The importance of these notions lies in their relation to the topological analysis through persistent homology of filtered simplicial structures, induced by point clouds with nonhomogeneous neighborhoods.
Let M be a disk system. Denote by the family of all Vietoris–Rips subsystems of M, this is,
Analogously, denote by the set of all Čech subsystems,
On the other hand, recall that a simplicial structure on a (finite) set V is defined as a family of subsets of V such that if and , then . Thus, for any every disk subsystem is also in the family . The same property is valid for the family . These properties imply that and are simplicial complexes.
We refer to as the generalized Vietoris–Rips complex associated to the disk system M, and to as the generalized Čech complex of M.
The above construction allows us to perform topological data analysis of point cloud data through the persistent homology of the generalized Vietoris–Rips or Čech complexes. However, to perform such analysis it is necessary to construct a filtered simplicial structure. We will define a filtration through weight functions.
Let be a simplicial complex and let be a function. We call a weight function over the simplicial complex if and , implies .
For example, to the generalized Čech complex of the disk system M, the function which assigns the Čech scale to any Čech subsystem , is a weight function, called the Čech-weight function. The analogous property holds for the Vietoris–Rips complex and the Vietoris–Rips scale (see  for the construction of the filtered generalized Čech complex using weighted point clouds).
Moreover, from the definition we have for the Čech-weight function and to every non-negative scale , that
We denote by the family for , i.e., the family of all Čech subsystems of the -rescaled disk system , in order to make the dependence explicit with respect the the parameter. We establish the analogous definition for , for any .
Note that there is no restriction on the scale , additional to the non-negativity, i.e., we allow greater values of than 1, in the interest of studying the generalized Čech complex of rescaled disk systems beyond the original.
For we have the families contention: and . In general, given a simplicial complex and a weight function , any increasing sequence of real numbers induces a simplicial filtration: for . Thus, for any disk system M, the generalized Čech complex has a filtered simplicial complex structure,
Of course, when we vary the scale on a interval the above filtration contains only a finite number of different sets. Moreover, those sets only change when the Čech scale of some disk system is reached, and therefore it is enough to compute all sets corresponding to Čech scales to characterize entirely the filtration. The goal of the next sections is the construction of algorithms to numerically estimate the Čech scale of every Čech subsystem of M.
The filtered generalized Čech complex can be “approximated” by the Vietoris–Rips structure, in the following sense. The inclusion holds clearly; in consequence, for any scale , then by Lemma 2 any Vietoris–Rips d-system rescaled by a factor of is also a Čech d-system: . Therefore, for any d-disk system M the following relation is fulfilled:
To any disk system M, the simplicial substructure given by the 1-skeleton of the generalized Čech complex of M is a basic combinatorial structure (actually, a graph) that can be easily defined, it just takes the relationship into account if every two vertices are neighbors: the set of vertices is M, and there exists an edge whenever . The Čech-weight function restricted to is, in fact: to every vertice, and to any edge.
In Algorithm 1, we calculate the Čech-weight function , for the dim-skeleton of a -rescaled disk system M. To do this, we assume an arbitrary linear order in the disk system M, and for every disk we consider the following set.
The following algorithm (based on work in ), is a standard expansion algorithm for simplicial complexes, and we are including the Čech-weight function value of each simplex when it is calculated.
Algorithm 1: Čech-weight function of a d-disk system.
We conclude the section with an application of Algorithm 1 to a 2-disk system.
Let M be the following 2-disk system,
The output of Algorithm 1 applied to M, with , and gives the Čech scales indicated next to every edge and in the triangle, in Figure 2. The Čech scale of the 2-disk system was calculated with theCech.scalescript from Algorithm 3.
4. Intersection Properties of Disk Systems
In this section, we focus on studying disk systems in the plane, i.e., 2-disk systems. As we have seen in the last section, the study of the Čech scale is a key aspect to the construction and study of filtered generalized Čech complex. In this section, we establish several intersection properties of 2-disk systems, which will lead us to be able to calculate the Čech scale.
Let be the boundary of the closed 2-dimensional disk .
Let and be two closed disks in the plane, such that . We define to be the unitary set constructed as follows.
If , then is the only one point with the property , where is the normal vector to ,
If , we define as the unique intersection point in , for given as the minimal scale such that or , i.e., .
Clearly, if , then . In particular, when and are concentric, then . On the other hand, if the closed disks and are internally or externally tangent, then . We can think about , when is not empty, as the intersection point of the boundaries at the left of the vector from to . Figure 3 shows the above construction.
We will denote by , instead of simply , for the intersection point of the -rescaled disks and .
In order to study Čech systems, we give the following characterization, according the intersection points .
Let be a 2-disk system. Then M is a Čech system if and only if, there exist such that satisfies for all .
Suppose M is a Čech system. Define ; then, A has only one of the following geometries.
A is a region bounded by more than one circumference arc,
for some .
In the first case, necessarily belongs to the boundary of two or more disks. Let and be two disks in M such that , it follows that or , in both cases the lemma holds.
For the second case, if belongs to the boundary and is in the intersection of two arcs, say and , then or , and it satisfy for every .
For the last case, if for some , then for each we have and all of these points belongs to for all .
Therefore, in any case, there exists such point . The converse is clear by definition of a Čech system. □
This criterion was presented in (, Section III) for a 2-disk system.
Next, we define the map , a key tool for the rest of this work. This map will allow us to discern the minimal scale in which a 2-disk system has the nonempty intersection property.
Let be a Vietoris–Rips system in the plane, with . We define
If is the Vietoris–Rips scale of M, then we define the map , .
Given three disks , and in the 2-disk system , with Vietoris–Rips scale , denote by the map , where is the element in . In other words, is the signed distance from the point to the set .
If , then for each the map is defined and continuous in the closed interval , as it is the signed distance from an intersection point of two continuously deforming curves (therefore its position vary continuously as long as the intersection exists) to the continuously deforming set with respect to . Also, the map vary linearly in the range because for , the term remains constant. The left picture in Figure 4 shows in bold red color the geometric place of , which vary continuously respect to the parameter and also the distance from it to the fix point .
On the other hand, for , the points vary continuously respect to on the line showed in the right picture of Figure 4. Therefore, also depend continuously of .
From the above argument, each map is continuous in the interval , and by the continuity of the min-max functions and that
it follows that is also a continuous map in the interval . However, the map is not differentiable, in general, to every point in such interval.
The map plays a key role in the rest of this work. We present the next characterization of Čech systems in terms of .
Let M be a 2-disk system. Then is a Čech system if and only if, . In particular .
By Lemma 3, is a Čech system in the plane if and only if, there exists such that for every , i.e., for every , which is equivalent to .
On the other hand, from Corollary 1 and taking , the rescaled system is a Čech system, then by the first assertion, . □
5. The Cech.scale Algorithm
Our main algorithm (Algorithm 3) computes the Čech scale of a given 2-disk system M. The key aspect on which this algorithm is based, is precisely the function . Before we describe the algorithm, we need to analyze additional properties of .
It follows immediately from Lemma 4 that for every . Also, if at the Vietoris–Rips scale it holds that , then by the minimality of the Čech scale. We conclude that in this case (this is, ), the Čech scale is easily computable.
On the other hand, if then the Čech scale satisfies and moreover . This is a consequence of the continuity of , and the fact that for every and for . Thus, to find the Čech scale of a 2-disk system M for which , we need to solve the equation .
We propose a numerical approach to solve the equation and calculate the Čech scale under the hypothesis , as in this case, we actually know that (see Section 2) as consequence of the generalized Vietoris–Rips Lemma. We chose the bisection method for this purpose. We will denote the implementation of bisection method for the map through the interval , by bisection . The output of bisection is a real number such that . For the numerical method we are working with a precision of .
It is important to mention that the numerical method regula falsi was also used instead of the numerical method of bisection, in order to calculating the Čech scale. However, in our context, the efficiency of the program using the regula falsi numerical method is not better than if the numerical method of bisection is used.
The Algorithm 2 (below) has as input a 2-disk system M, and produces as output the Čech scale as well as the intersection point . This algorithm takes a naive approach to calculate the Čech scale, and is established to completeness and to be a reference for the principal algorithm (Algorithm 3).
Algorithm 2: The Čech scale calculation for a 2-disk system.
The following lemma claims that the Algorithm 2 is consistent.
For any 2-disk system M, the Algorithm 2 has as output the Čech scale of M, and the unique intersection point .
In the case , it is clear that the algorithm has generated asseverated data (steps (2)–(3)). In otherwise, for the case , we assign .
Then, and lets call again the output root in step (7). To check if is the Čech scale we are looking for, we calculate in step (8) the set of pairwise intersection points of the -rescaled system, contents in .
If the set is unitary, then necessarily is unitary, due the geometry of its boundary (see proof of Lemma 3). In such case (negative validation of step (9)) the steps (10)–(13) are omitted and, from Lemma 1, the algorithm returns the Čech scale as well as the intersection point at step (14); in otherwise (positive validation of step (9)), the root is not the Čech scale (see Figure 5), and then we should find another scale such that , and repeat from step (7). It is possible, for some configurations of the 2-disk system, that the map has a behavior as in Figure 5.
The last iterative part is a finite process because is algebraic over , then eventually the set will be unitary and the Čech scale will be calculated. □
The step (8) in Algorithm 2 is necessary, as show the following example, in which the map has another root along side the Čech scale in the interval .
Let be the 2-disk system in Figure 6. A direct calculation, yields that . On the other hand, we also have that for . Therefore, the map has more than one root on the interval .
In Example 3, the Vietoris–Rips scale , of the 2-disk system M, agrees with the Čech scale ; however is possible to construct more sophisticated (and symmetric) disk system M such that and , for which there exists with .
On the other hand, if the 2-disk system M consists of just three disks and , then its Čech scale can be computed with only one application of the numerical method, as we asseverate in the following lemma.
Let be a 2-disk system such that . Then, there exists a unique root of the map in . Thus, will be the output ofbisection.
It is straightforward to verify that for any configuration with , and collinear. Thus, it follows is in general position.
Let be the Čech scale of the 2-disk system M and the intersection point. Define . Note that .
We claim that there exist at least two distinct points p and q, in the set
This is evident if is given by two or more circumference arcs. On the other hand, if for some , then for and . Moreover, since is not a collinear set.
If both points p and q belongs to each boundary of the three disks, , then would be also a collinear set. Without loss of generality, we suppose that . Then, , and the lemma follows. Of course, the choose of the indexes depend of the value of , but the above arguments show that always there exist such combination which guarantee that is positive for . □
The following algorithm takes advantage of the unicity property for the root of , in a 2-disk system with three disks. Essentially, the algorithm consist in iterating the Algorithm 2 systematically over every triplet of disks from M.
For any 2-disk system M, the Algorithm 3 has as output the Čech scale of M, and the unique intersection point .
If , the algorithm returns the right data: steps (1)–(5).
On the other hand, by Helly’s Theorem (cf. ) the 2-disk system , as a finite family of convex sets in the plane, has a nonempty intersection if, and only if, for every triplet . Let be the maximal Čech scale over every triplet in the disk system M, i.e.,
It follows that every -rescaled triplet has a nonempty intersection. Therefore, the -rescaled 2-disk system also has the nonempty intersection property. Moreover, for every triplet . Therefore, is actually the Čech scale of the 2-disk system M, this is, .
In steps (6)–(19), the algorithm search the scale systematically, over every triplet , updating the maximal scale found if necessary in steps (15)–(17). By Lemma 6, every Čech scale calculation over any triplet, requires just one application of the bisection method. This implies the correctness of the algorithm.
Additionally, the condition in step (9) avoids calculating unnecessary Čech scales of triplets . In effect, if is the maximal Čech scale found until the verification of the triplet N, and the condition in step (9) does not satisfy, i.e.,
then, whatever is the Čech scale of N, it would be not greater than . □
The computational evidence to support the Algorithm 3 is more efficient than Algorithm 2, is given in Figure 7. The graphic shows the average time (in seconds) to computation of both algorithms, with respect to the number of disks in a randomly generated 2-disk system (see Remark 1).
An Example: The Miniball Problem
The miniball problem or smallest-circle problem in the euclidean space is a classical problem, proposed by James J. Sylvester in 1857.
Given a finite point cloud , the miniball problem consists in finding the center and minimum radius of a d-disk such that .
There exist many different approaches to solve this problem, and a variety of algorithms to reach the miniball data (e.g., [21,22]). In fact, the Čech scale has a close relation with the miniball problem, as we establish in the next lemma.
Let N be a finite point cloud in , and let be the associated d-disk system defined by
Then, the Čech scale is the radius of the minimal enclosing ball of N, and the intersection point its center.
Let be the Čech scale of the disk system , and let be the intersection point of the -rescaled disk system. Then, the point belongs to every disk , i.e., for any ; thus, . On the other hand, by definition of Čech scale, is the minimal radius (scale) with such property. Therefore, by uniqueness, must be the minimal ball enclosing the point cloud N. □
In particular, for a point cloud N in the plane we can apply our algorithm Cech.scale (Algorithm 3) to the 2-disk system , and get the minimal enclosing ball of N. However, the Čech scale of an arbitrary 2-disk system cannot be obtained from the minimal enclosing ball data of the point cloud .
In Figure 8, we show a point cloud N (black dots) and the 2-disk system (blue circles). Applying the Cech.scale script to we get the Čech scale (radio of the red circle) and the point (red point, center of the red circle).
For the miniball problem there are many efficient algorithms available online, which are easy to find. For example, the C++ script in  can compute the miniball for point clouds in any dimension (efficiently up to dimension 10,000). Such algorithms are not comparable with the Cech.scale algorithm because if only disk systems with equal (and unitary) radii were considered, several issues that were addressed in the case of different radii would be avoided.
6. The Algorithm Cech.scale for Higher-Dimensional Disk Systems
It is not clear how to generalize the Algorithm 3 to determine the Čech scale of a disk system in with . However, it is possible to calculate the Čech scale if the d-disk system consists of only three disks. This makes it possible to calculate the 2-skeleton associated with a d-disk system in an arbitrary dimension.
The relevance of this application lies in the possibility of calculating the 2-dimensional filtered simplicial Čech structure of a disk system immersed in a high-dimensional euclidean space. Many applications in topological data analysis concerns to the study of low-dimensional topological features associated to a point data cloud immersed in a high-dimensional representation space.
The key observation is that
where P is the affine plane generated by the set .
Thus, the problem of determining whether is empty or not, can be treated as one in the plane, constructing a disk system in that preserves the affine configuration of the points in the affine space . To do this, we set the first center as the origin in , and “translate” the others centers preserving their original configuration, taking care of moving the second center on the x-axis, as in Figure 9.
More precisely, to any d-disk system with three elements, say , we associate the following 2-disk system, which clearly preserves the affine configuration of the original centers ,
where , , , where is the angle between the vectors and , which satisfies the following relationship:
The Algorithm 4 is a variant of Algorithm 1, taking as input a d-disk system in and a non-negative parameter , and as output the Čech weight function of the 2-skeleton of the generalized Čech complex structure. The algorithm first preprocess each triplet of d-disks as a 2-disk system, then the Čech scale is calculated.
Algorithm 4: 2-skeletal Čech-weight function.
Figure 10 shows the performance (in s) of the C/C++ script Cech.scale (available in ) and the preprocessing of the d-disk system to a 2-disk system.
All our timings were done on a 64-bit GNU/Linux machine with two Intel Xeon processors (3.40 GHz), although our script were not threaded and only one core was used per process. We measured all the timings withclock()from the Standard C library. The average times in both graphics (Figure 7 and Figure 10) are the mean times for repetitions of each algorithm, for every number of disks multiple of 10 in Figure 7 from 10 to 500, and for every dimension multiple of 200 in Figure 10 from 200 to 10,000.
Conceptualization, J.F.E., R.H.-A. and B.R.-V.; methodology, J.F.E., R.H.-A. and B.R.-V.; software, J.F.E., R.H.-A., H.A.H.-H. and B.R.-V.; validation, J.F.E., H.A.H.-H. and B.R.-V.; formal analysis, J.F.E., R.H.-A., H.A.H.-H. and B.R.-V.; investigation, J.F.E., R.H.-A., H.A.H.-H. and B.R.-V.; data curation, J.F.E. and B.R.-V.; writing-original draft preparation, J.F.E., R.H.-A., H.A.H.-H. and B.R.-V.; writing-review and editing, J.F.E., R.H.-A., H.A.H.-H. and B.R.-V.; visualization, J.F.E. and B.R.-V.; supervision, J.F.E.; project administration, J.F.E.; funding acquisition, J.F.E. All authors have read and agreed to the published version of the manuscript.
This research received funding of the project “Métodos de Topología Combinatoria en el Análisis de Datos” supported by PRODEP.
The author Jesús F. Espinoza acknowledges the financial support of PRODEP and of the Universidad de Sonora, as well as the ACARUS (High Performance Computing Area) for the support in the access to the clusters.
Carlsson, G. Topological pattern recognition for point cloud data. Acta Numer.2014, 23, 289–368. [Google Scholar] [CrossRef]
Ghrist, R. Barcodes: The persistent topology of data. Bull. Am. Math. Soc.2008, 45, 61–75. [Google Scholar] [CrossRef]
Lum, P.Y.; Singh, G.; Lehman, A.; Ishkanov, T.; Vejdemo-Johansson, M.; Alagappan, M.; Carlsson, J.; Carlsson, G. Extracting insights from the shape of complex data using topology. Sci. Rep.2013, 3. [Google Scholar] [CrossRef] [PubMed]
Edelsbrunner, H.; Harer, J. Computational Topology: An Introduction; American Mathematical Society: Providence, RI, USA, 2010. [Google Scholar]
Zomorodian, A. Fast construction of the Vietoris-Rips complex. Comput. Graph.2010, 34, 263–271. [Google Scholar] [CrossRef]
Le, N.K.; Martins, P.; Decreusefond, L.; Vergne, A. Construction of the Generalized Čech Complex. In Proceedings of the 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), Glasgow, UK, 11–14 May 2015; pp. 1–5. [Google Scholar] [CrossRef]
Dantchev, S.; Ivrissimtzis, I. Efficient construction of the Čech complex. Comput. Graph.2012, 36, 708–713. [Google Scholar] [CrossRef]
Otter, N.; Porter, M.A.; Tillmann, U.; Grindrod, P.; Harrington, H.A. A roadmap for the computation of persistent homology. EPJ Data Sci.2017, 6, 17. [Google Scholar] [CrossRef]
Kerber, M.; Sharathkumar, R. Approximate Čech complex in low and high dimensions. In Algorithms and Computation; Cai, L., Cheng, S.W., Lam, T.W., Eds.; Springer: Berlin/Heidelberg, Germany, 2013; pp. 666–676. [Google Scholar]
Bendich, P.; Marron, J.S.; Miller, E.; Pieloch, A.; Skwerer, S. Persistent homology analysis of brain artery trees. Ann. Appl. Stat.2016, 10, 198–218. [Google Scholar] [CrossRef] [PubMed]
Goldfarb, D. An application of topological data analysis to hockey analytics. arXiv2014, arXiv:1409.7635v1. [Google Scholar]
Pokorny, F.T.; Hawasly, M.; Ramamoorthy, S. Topological trajectory classification with filtrations of simplicial complexes and persistent homology. Int. J. Robot. Res.2016, 35, 204–223. [Google Scholar] [CrossRef]
Robins, V.; Turner, K. Principal component analysis of persistent homology rank functions with case studies of spatial point patterns, sphere packing and colloids. Phys. D Nonlinear Phenom.2016, 334, 99–117. [Google Scholar] [CrossRef]
deSilva, V.; Ghrist, R. Coverage in sensor networks via persistent homology. Algebr. Geom. Topol.2007, 7, 339–358. [Google Scholar] [CrossRef]
Jung, H. Ueber die kleinste Kugel, die eine räumliche Figur einschliesst. J. Reine Angew. Math.1901, 123, 241–257. [Google Scholar] [CrossRef]
Bollobas, B.; Bollobás, B. The Art of Mathematics: Coffee Time in Memphis; Cambridge University Press: Cambridge, UK, 2006. [Google Scholar]
Fischer, K.; Gärtner, B.; Kutz, M. Fast smallest-enclosing-ball computation in high dimensions. In Algorithms—ESA 2003; Di Battista, G., Zwick, U., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2003; Volume 2832, pp. 630–641. [Google Scholar] [CrossRef]
Welzl, E. Smallest enclosing disks (balls and ellipsoids). In New Results and New Trends in Computer Science; Maurer, H., Ed.; Springer: Berlin/Heidelberg, Germany, 1991; pp. 359–370. [Google Scholar]