Abstract
We study the k-th nearest neighbor distance function from a finite point-set in . We provide a Morse theoretic framework to analyze the sub-level set topology. In particular, we present a simple combinatorial-geometric characterization for critical points and their indices, along with detailed information about the possible changes in homology at the critical levels. We conclude by computing the expected number of critical points for a homogeneous Poisson process. Our results deliver significant insights and tools for the analysis of persistent homology in order-k Delaunay mosaics, and random k-fold coverage.
Keywords: Applied topology, Morse theory, Distance function, k-nearest neighbor
Introduction
Let be a finite subset of , with . We define the k-nearest neighbor distance (k-NN) function as
where is a closed ball of radius r centered at x. For we have the simple case of the distance function
The k-NN distance function arises naturally in numerous applications, including coverage in sensor networks, shape reconstruction, and clustering [10, 31]. A key reason for the interest in comes from the fact that its sub-level sets are the k-fold covers, i.e.,
| 1 |
In other words contains all points that are covered by at least k balls of radius r, centered at . For we denote , which is simply the union of the balls around . Our main goal in this paper is to present a simple and comprehensive Morse theory for , which is key to future study of this function within the context of applied and stochastic topology.
Morse theory [26] lies at the intersection of topology and analysis, linking local differential properties to global structural changes. Specifically, it analyzes how critical points of different indexes affect the homotopy type of the sub-level sets of a function. The classical definition of Morse theory applies to smooth functions, where the location and index of the critical points are determined by the gradient and Hessian, respectively. As is not a differentiable function, the original notions do not apply anymore. Nevertheless, we will show in this paper that there is a relatively simple geometric-combinatorial way to define critical points for . Furthermore, when the points are in general position (e.g., when is random), we can show that the critical values are distinct, as in a classical Morse function. However, we note that as opposed to Morse functions, the sublevel sets of may undergo multiple changes at each critical point.
In [5] the authors provided a combinatorial-geometric description for the critical points of the distance function , their index and homological effect, based on an adaptation of Morse theory to min-type functions [19]. The key property of which enabled the results in [5] is that is a min-type function, i.e., it can be expressed locally as the minimum of a finite collection of differentiable functions. This property, however, does not extend to (), rendering the previous approach inapplicable. In response, our paper adopts an alternative strategy, employing an extended Morse-theoretic framework [2] designed for continuous selections of smooth functions (which include min-type functions). The key advantage of this framework, is the ability to define and analyze critical points of continuous selections (generally non-smooth) through the derivatives of their smooth representatives. Leveraging this framework, we establish a simplified combinatorial-geometric representation for the critical points of and their homological effect. Notably, this description generalizes the one in [5] for the distance function .
A key motivation for this work is the study of random k-fold coverage [7, 15, 18, 21, 23, 27, 28]. While the k-fold coverage process has an intrinsic mathematical interest, it also has applications in numerous fields. For instance, in cellular networks, k-fold coverage provides redundancy that guarantees the network robustness to antenna failures [33]. In shape reconstruction, guaranteeing k-fold coverage is useful in the context of outliers removal [15, 32]. Other examples include wireless communication [20], stochastic optimization [34], topological data analysis (TDA) [4], immunology [27], and more [3, 9].
A related theoretical motivation comes from the field of stochastic topology, and specifically from the study of homological connectivity for a random k-fold cover. For , the critical points of played a key role in analyzing the last changes in the homology of the random cover , as r is increased. Taking to be a homogeneous Poisson process on a d-dimensional compact manifold, with rate n, it was proved [4] that passing the threshold , in the limit as , the i-th homology of will remain unchanged if we further increase r. Additionally, a functional Poisson limit was proved [6] for the locations and radii at which the last i-cycles appear. Note that for , this analysis describes the exact moment at which covers the manifold, and the critical points of index d correspond to the last uncovered connected components. The results presented here will play a similar role in analyzing homological connectivity for the random k-fold cover . In particular, this will enable a detailed theoretical analysis for the k-fold coverage problem discussed above.
We note that the Morse theoretic framework we develop here for is tightly related to the study of the order-k Delaunay mosaics [15, 17]. These simplicial complexes, denoted , generalize the Delaunay triangulation and are analogously constructed from the order-k Voronoi tessellations [11]. Similarly to the alpha shapes [12], the authors in [15] define a sub-complex that has the same homotopy type as the k-fold cover . Thus, these sub-complexes can serve as a proxy for computing the persistent homology of the k-fold cover filtration. The study in [17] identifies critical configurations in , in the sense that once the corresponding cell enters the filtration , it changes the Euler characteristic, and consequently the homotopy-type. What we provide here is a Morse theoretic view on such critical configurations (‘steps’), showing that they in fact originate from critical points of . Additionally, we are able to classify them by their index, and to provide a detailed description for the effect these critical configurations have on the homology of , i.e., beyond the Euler characteristic.
Main Results
We start by briefly reviewing the fundamental statements for Morse theory for the distance function () [5], based on the Morse theory for min-type functions [19]. The assumption (here and throughout the paper) is that the points in are in general position. In other words, no subset of size lies on a -dimensional flat, and no point of is on the circumsphere of Q.
For a point , denote , and (where denotes the boundary of the ball). The point is critical for if and only if (the open simplex spanned by ). The index of c in this case is . Note that this definition is a special case of the framework developed in [19] for min-type functions. Similarly to classical Morse theory, it follows from [19] that every such critical point of index either adds a new generator to the i-th homology of , or eliminates a generator in the -th homology.
While the function can be defined as a minimum of a finite set of functions, as we show later in (10), is not a min-type function (for ) since the minimum is over functions that are not smooth. Therefore, we switch to the more general context of piecewise smooth functions and continuous selections, developed in [2]. In the following when we refer to ‘critical points’, we mean the formal characterization detailed in Definition 1 below.
The general definition of critical points for piecewise smooth functions requires some technical background in differential geometry which we postpone to Section 3. Our main result is to show that for the case of we can provide a simplified equivalent definition, that is easy to verify in practice. In the following we focus on the case . However, our approach and results apply to the case as well.
Let , and denote . Define
| 2 |
and correspondingly,
| 3 |
so that , and . Note that the definition of implies that , and since the points are in general position, we have . For examples, see Figure 1.
Fig. 1.

Critical points of in , for . The points , and y are in , and the point c represents the critical point. Top left: , , and . This critical point adds a new generator to (new component). Bottom left: , , and . This critical point kills a generator in (components merge). Top right: , , and . This critical point kills two generators in (three components merge into one). Bottom right: , , and . This critical point kills an existing 1-cycle.
The following theorems are the main contribution of our paper, namely the characterization of critical points and their indexes, and the changes in homology induced by critical points.
Theorem 1
A point is a critical point of , if and only if . The index of c is defined as . All critical points of are non-degenerate.
Since , and , we have , as expected. Additionally, in the special case , we have only one option – , and . Finally, note that for , the characterization in Theorem 1 coincides with that of the distance function discussed above. For examples of critical points of , see Figure 1.
The next theorem summarizes the effects of critical points on the homology of the k-fold cover (1). We consider homology with coefficients in a field . We will assume from here onwards that is a Morse function, in the sense that critical points occur at distinct critical levels. While it is easy to find examples where this is not the case, our motivation is the case where is random. For random point-sets, the probability to have two critical points with the same critical value is zero.
Theorem 2
Let be a critical point of of index . Let such that the interval contains a single critical point (namely, c). Denote and . Then for , we have
| 4 |
where are positive integers such that .
If , then
Note that the left and right relations in (4) reflect the generation (birth) of cycles in dimension , and the elimination (death) of cycles in dimension , respectively, when passing through the critical value . In addition, these results generalize the behavior known in classical Morse theory (and for the distance function ), where . For the highest index (), we have that in the k-NN distance as well.
Remark 1
While Theorem 2 provides the total number of changes in the homology, it does not indicate the exact values of and , i.e., the number of positive (generation of a cycle) and negative (elimination of a cycle) changes. To obtain these values, additional analysis is required (see Figure 2). This follows from the nature of Morse theory which is local, while the exact changes are associated with global properties of the k-fold cover. One way to identify the exact changes, is via the persistent homology [13, 35] of the k-Delaunay complex [14].
Fig. 2.

The effect of a critical point on the homology. The point is a critical point of of index , where . In this case, we have , and therefore, . Indeed, we observe exactly two changes in the homology of the sub-level sets (purple shaded regions), once c is reached. One change is the generation of a new 1-cycle on the right side (the red dashed cycle). Another change is the elimination of the connected component (0-cycle) on the left side
Remark 2
The characterization of critical points via Theorem 1 coincides with the notion of ‘critical steps’ in [17]. Thus, an immediate conclusion is that there is a one-to-one correspondence between critical points of and the critical steps in the order-k Delaunay filtration. The approach in [17] was to examine the combinatorial structure of the order-k Delaunay mosaic, and track changes in the Euler characteristic. The Morse-theoretic approach allows us to obtain the detailed description for homology presented in Theorem 2.
Morse theory for piecewise smooth functions
To prove our main results, we build on the Morse theory for piecewise smooth functions developed in [2]. In this section, we briefly review the main statements needed for our arguments. These will be used in Sections 4 and 5 to prove Theorems 1 and 2, respectively. Some of the more technical parts of these proofs, which require a closer familiarity with [2], are intentionally postponed to Section 6 to maintain a smoother flow. For simplicity, we restrict our discussion to Morse theory in .
The definition of critical points in [2] relies on the notion of the Clarke subdifferential [8]. Let be Lipschitz near a point . The Clarke generalized derivative at in the direction , is defined as
The Clarke subdifferential of f at , denoted by , is defined as
This Clarke subdifferential allows us to define critical points for locally-Lipschitz functions.
Definition 1
(Definition 1.1 in [2]) Let be locally Lipschitz. A point is called critical if .
Let be a collection of continuous functions. A continuous function is called a continuous selection of , if for every we have for some . For every x, define
| 5 |
where and stand for the closure and interior, respectively. In the case where are all , then f is locally Lipschitz, and its Clarke subdifferential is given by
| 6 |
where stands for the convex hull. This representation allows us to define non-degenerate critical points for continuous selections.
For fixed and , define
Definition 2
(Definition 2.2 in [2]) A critical point is called non-degenerate if the following conditions hold:
For each , the set of gradients is linearly independent,
- The Hessian of at c, denoted , is invertible on T(c) , where satisfies
Note that (6) guarantees that exists, since can be represented as a convex combination of , and the first condition in Definition 2 guarantees that it is unique. The quadratic index is defined as the dimension of the maximal linear subspace of T(c) on which is negative definite.
According to [2] (Theorem 2.3), for every non-degenerate point c, there exists a neighborhood , where f is locally topologically equivalent to a function of the form
| 7 |
where , is a continuous selection of , is the quadratic index, and is some neighborhood of .
Next, we define
| 8 |
The following theorem presents the effect of a critical point c on the relative homology.
Theorem 3
(Theorem 4.2 in [2]) Let be locally Lipschitz, and let be a non-degenerate critical point of f. Then,
- If c is a local minimum (), then
- If c is not a local minimum (), then
where is the number of connected components of the set (with ).
Critical points for the -NN distance function
In this section we use the framework presented in Section 3, to prove Theorem 1, namely the characterization of the critical points.
To simplify some of the calculations, we will prove Theorem 1 for the squared k-NN distance, denoted . Any conclusion we make using Morse theory for can be immediately translated to an equivalent statement about . We will therefore consider every critical point of as a critical point of .
Note that to prove Theorem 1 we have to show that the point in question is (a) critical, and (b) non-degenerate. We start with criticality.
Lemma 4
A point is a critical point of if and only if , where was defined in (2).
Proof
Without loss of generality we take . Recall the definition of I(x) in (5), and note that for the indexes in the set correspond to the points in . From (6), we have that the Clarke subdifferential of at is given by
Since is the squared distance from p, we have , and therefore . Since if and only if (reflected and scaled versions of the same simplex), and using Definition 1, the proof is complete.
Next, we will show that all critical points in Theorem 1 are indeed non-degenerate.
Lemma 5
Let , such that . Then, c is non-degenerate for .
Proof
As before, we take . In our setting we have , and . Since we assume the points are in general position, the first condition in Definition 2 holds immediately. The Hessian of is (the identity matrix). Therefore, everywhere, and in particular on T(c), implying that the second condition in Definition 2 holds as well.
Remark 3
The proof above shows that the Hessian is always positive definite, and therefore the quadratic index (see Section 3) in this case is zero.
Proof for Theorem 1
Critical points and homology
In this section, we study the effect of the critical points of on the homology of its sub-level sets , and prove Theorem 2.
Recall the definition of in (8). A key observation in the special case of is that the homology of is simple to describe.
Lemma 6
Let c be a critical point of , of index , and denote . If , then
If , then
The proof for Lemma 6 requires more details from [2], and is postponed to Section 6. We use it here to prove the following special case of Theorem 3 to .
Proposition 7
Let be a critical point of of index . Then, the following holds.
- If , then c is a local minimum, and
- If , then
Proof
When we have that . Additionally, as we prove later in Corollary 9, there is a small neighborhood , such that for all . Note that at c we have , for any . However, since , for every point there exists such that . Thus, c is a local minimum. The first part of the theorem then follows from the first part of Theorem 3.
For , c is not a minimum, so we refer to the second part of Theorem 3. If , then the result follows directly from Lemma 6. For , from Lemma 6 the number of connected components of is , and therefore, the second case in Theorem 3 reduces to , for , and 0 otherwise.
We can now prove Theorem 2.
Proof of Theorem 2
Define
Then , and , since the critical values of are distinct. By the excision theorem (cf. Theorem 2.20 in [22]), we have
| 9 |
Next, consider the long exact sequence for the relative homology,
Firstly, consider the case where . Then for , from Proposition 7 we have
which implies . In other words, there is no change in the i-th homology of when reaching the point c. For , we have
Exactness then implies that
for some , with .
Next, assume that . Similarly to the above, for there is no change in the homology. For we have
By exactness, we have .
Finally, note that there exists such that the interval contains exactly one critical value (namely, ). From Proposition 2.1 in [2], we have that , and . This completes the proof.
Additional proof elements
In this section we provide more details required for the proofs in Sections 4 and 5.
Geometric ingredients
To use the framework presented in Section 3, we will show that for every we can find a small enough neighborhood, where is a continuous selection of . We say that such a representation is minimal, if each in the selection coincides with at some point in the neighborhood while all others do not, so no element is redundant.
Lemma 8
Let be a finite set, and let . Then there exists an open ball , centered at c, where is a continuous selection of , and this representation is minimal.
Proof
Let , and . Define
Let . Then the open ball of radius centered at z includes , and thus all the points in . In addition, this open ball is included in , and therefore it excludes the points of . Similarly, the open ball of radius centered at z, includes and excludes the points of . Thus, setting concludes the first part of the proof.
Next, let and denote . Let sufficiently small, and denote . Then, p is necessarily one of the k-nearest neighbors of z, since for all , we have
Thus, the representation of as a continuous selection of is minimal.
The k-NN distance function is tightly related to the order-k Voronoi tessellation [11, 24]. This is a generalization of the (order-1) Voronoi tessellation, that decomposes into convex regions whose points have the same k-nearest-neighbors. Formally, let be a subset of size k. Then the order-k Voronoi cell of is defined as
Alternatively, we can write
where is a standard Voronoi cell. Note that is a convex set, and can also be empty. If we say that is a k-NN subset.
Let , and denote all the k-NN subsets of by . In addition, for any , define , and for all , denote by the set of indices, such that . Using the definitions above, we can write as
| 10 |
We can refine this representation, using Lemma 8.
Corollary 9
Let be a finite set, and let . Then there exists a neighborhood where
In particular, in , we have .
Topological ingredients
Our goal here is to provide a refined local description for the squared k-NN distance , which will lead to the proof of Lemma 6.
Let be a critical point of . By Lemma 8, there exists a neighborhood , in which is a continuous selection of . Moreover, from (7), and since the quadratic index is 0, it is locally topologically equivalent to
| 11 |
Furthermore, the function admits a min-max representation as a continuous selection of linear functions [2]. The exact representation is given by the following lemma.
Lemma 10
The min-max representation of is given by
| 12 |
where is one of the functions (), or .
Proof
Denote , and assume without loss of generality that . In addition, denote , , and . Recall that all lie on a q-dimensional plane, and assume without loss of generality, that this plane is H.
Let , such that is sufficiently small. Using Corollary 9, we know that f(x) is determined by one of the functions at . We can approximate f(x) based on the second order approximations of around . Namely,
| 13 |
where , and we used the fact that the Hessian of is . Let , where denote the projections of x to , respectively. Note that since , for all , we have for all . In other words, the linear terms in (13) depend only on the first coordinates of x. Thus, for , we can assume that the second order term is negligible, while for the first order term vanishes. Therefore, we have
| 14 |
Finally, since the gradients are linearly dependent, we can express as , where , where is defined in Definition 2. Therefore, the form (14) is the same as (11) up to a change of coordinates, and we can identify with the min-max term in (14).
Proof of Lemma 6
Based on the min-max representation for we obtained in (11) and (12), we can use Theorem 4.1 in [2] to establish the homology of . This theorem makes use of an ‘auxiliary complex’, which we compute below for the special case of .
Take a critical point and assume without loss of generality that . For in (11), define Following (12) we have where . Given this representation, it was shown in Proposition 2.5 in [2] that the following simplicial complex is homotopy equivalent to S. For each we define its complement by . The auxiliary complex of c, denoted , is the nerve of the simplexes . In fact, for the special case of , we observe that is just the -dimensional skeleton (recall that ) of the simplex spanned by . Note that the dimension of does not exceed d. See Figure 3 for examples of this auxiliary complex.
Fig. 3.

The auxiliary complex used in the proof of Lemma 6. Left: In both figures c is a critical point of , and the purple regions are the 2-fold cover, at radius r that is slightly smaller than . Right: The corresponding auxiliary complex (in green). Top: The critical point c is of index . The sets are equal to , respectively. Thus, the sets that span , are equal to , respectively. Bottom: The critical point c is of index . The sets are equal to . Thus, the sets that span , are equal to , respectively.
For the case where the quadratic index is zero (as in our case), Theorem 4.1 in [6] states that . Since is the -dimensional skeleton of a -dimensional simplex, we have the following. Denote . If ,
If ,
This completes the proof.
The expected number of critical points
In this section we examine the k-NN distance function for a random point set . The characterization of critical points in Theorem 1, enables us to count the number of critical points in a given region and with a given index, and to compute its expecation.
A homogeneous Poisson point process in with intensity , has the following properties:
The number of points in a Borel set has a Poisson distribution with parameter (where is the volume).
If A and B are two disjoint Borel sets, then the number of points in A and the number of points in B are independent random variables.
The homogeneous Poisson process is a typical case study in stochastic geometry and topology. It has been shown that various topological quantities are linear in (in expectation) [14, 16, 29]. We will show that the critical points for are no different.
Theorem 11
Let be a homogeneous Poisson point process with intensity . Let , and let . Let be a compact subset, and denote by the number of critical points of , with index , lying in . Then,
where is a constant that depends on k, i, and .
To prove the above theorem, we follow the configurations of points in that generate critical points for the k-NN distance function .
Let be a finite set in general position, of size . Each critical point of is associated with a critical configuration of points of , as follows. Let of size , where , and denote by the unique -dimensional minimal circumsphere of . In addition, denote
From Theorem 1 we have that is a critical point of of index , if and only if
Lemma 12
Let be a homogeneous Poisson point process with intensity . Let , and . Let be a compact subset, and denote by the number of subsets of size , such that , and . Then,
where is a constant that depends on d, i, j, and .
Proof
Fix , and . For finite subsets , with , define
and
Using these notations, we can express as
Taking the expectation, and applying the Slivnyak-Mecke formula (see Corollary 3.2.3 in [30]), yields
| 15 |
where abusing notation we treat as both an ordered tuple and a set. For a fixed we have
where denotes the volume of a unit ball in . Next, we use generalized spherical coordinates (a Blaschke-Petkantschin formula [25]), that will be explored in Appendix A. Assuming the points in are in general position (which is true almost surely), they lie on a unique i-dimensional linear space, denoted (that includes ). Recall that the points of lie on a -dimensional sphere centered at of radius . We will denote the spherical coordinates of on this sphere. We are interested in the bijective transformation .
Turning back to the integral in (15), and applying Lemma 13, we have
where stands for the i-dimensional volume of the simplex spanned by , and
Taking the change of variable , yields
where . Going back to (15), we have
where , concluding the proof.
Proof of Theorem 11
Recall from Theorem 1 that is the index of the generated critical point. In addition, , and . The last three terms, limit the possible values can take, namely
and . Thus, the number of critical points of index , is given by
where , , and . By taking the expected value and applying Lemma 12, we have
Setting concludes the proof.
Discussion
In this paper we studied the k-NN distance function . We showed that using the Morse theory for piecewise smooth functions we can derive simple combinatorial-geometric characterization for critical points and their indices. In addition, we showed the effect of such critical points on the homology of the sub-level sets. We observe that the behavior of is similar to classical Morse theory, in the sense that if the index is the homology affected is only in dimensions (positively) and (negatively). However, in contrast to classical Morse theory, at each critical level there can be several simultaneous changes to homology. Our results provide new means to analyze the homology and persistent homology of the k-degree Delaunay mosaics. In addition, they will be instrumental for the analysis of random k-fold coverage and its homology. Specifically, counting critical faces, as we present in Theorem 11, will allow us to draw conclusions about the homology of the random k-fold coverage objects, in different regimes. This remains future work.
Acknowledgements
The authors are grateful to Primoz Skraba, for his feedback and advice. We would also like to thank the anonymous referees for their useful comments and suggestions. YR was partially supported by the Israel Science Foundation, Grant 2539/17. OB was partially supported by the Israel Science Foundation grant 1965/19, by the EPSRC grants EP/Y008642/1, and EP/Y028872/1, and by the Leverhulme Trust grant RPG-2023-144. Part of this work was done while OB was at the Technion – Israel Institute of Technology.
Blaschke–Petkantschin-type formula
The following lemma (cf. Eq. (11) in [16], and Lemma C.1 in [4]), introduces a change of variables from Euclidean into spherical coordinates. This transformation is essential to our analysis of random points, since it allows us to view every subset by the potential critical point it generates. For further details, see [4, 16].
Let , and consider the following mapping defined in the proof of Lemma 12. Next, let be affine invariant. This implies that
| 1 |
where is the canonical embedding of in as .
Lemma 13
Let be a measurable bounded function satisfying (1), and let be a compact subset. Then,
where is the volume of the i-simplex spanned by , , and is the volume of the Grassmannian .
Funding
Open access funding provided by Technion - Israel Institute of Technology.
Data Availability
This research has no associated data.
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D., Belongie, S.: Beyond pairwise clustering. In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), 2, 838–8452 (2005)
- 2.Agrachev, A., Pallaschke, D., Scholtes, S.: On morse theory for piecewise smooth functions. J. Dyn. Control Syst. 3(4), 449–469 (1997) [Google Scholar]
- 3.Athreya, S., Roy, R., Sarkar, A.: On the coverage of space by random sets. Adv. Appl. Probab. 36(1), 1–18 (2004) [Google Scholar]
- 4.Bobrowski, O.: Homological connectivity in random Čech complexes. Probab. Theory Relat. Fields 183(3–4), 715–788 (2022)
- 5.Bobrowski, O., Adler, R.J.: Distance functions, critical points, and the topology of random Čech complexes. Homol. Homotopy Appl. 16(2), 311–344 (2014) [Google Scholar]
- 6.Bobrowski, O., Schulte, M., Yogeshwaran, D.: Poisson process approximation under stabilization and palm coupling. Ann. Henri Lebesgue 5, 1489–1534 (2022) [Google Scholar]
- 7.Chiu, S.N., Stoyan, D., Kendall, W.S., Mecke, J.: Stochastic Geometry and its Applications. John Wiley & Sons (2013)
- 8.Clarke, F.H.: Generalized gradients and applications. Trans. Am. Math. Soc. 205, 247–262 (1975) [Google Scholar]
- 9.Cuevas, A., Rodríguez-Casal, A.: On boundary estimation. Adv. Appl. Probab. 36, 340–354 (2004) [Google Scholar]
- 10.Dudani, S.A.: The distance-weighted k-nearest-neighbor rule. IEEE Trans. Syst. Man Cybern. 4, 325–327 (1976) [Google Scholar]
- 11.Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. In: Proceedings of the First Annual Symposium on Computational Geometry, pp. 251–262 (1985)
- 12.Edelsbrunner, H.: Alpha shapes-a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, (2011)
- 13.Edelsbrunner, H., Harer, J., et al.: Persistent homology-a survey. Contemp. Math. 453(26), 257–282 (2008) [Google Scholar]
- 14.Edelsbrunner, H., Nikitenko, A.: Poisson-Delaunay mosaics of order k. Discret. Comput. Geom. 62, 865–878 (2019) [DOI] [PMC free article] [PubMed] [Google Scholar]
- 15.Edelsbrunner, H., Osang, G.: The multi-cover persistence of Euclidean balls. Discret. Comput. Geom. 65, 1296–1313 (2021) [DOI] [PMC free article] [PubMed] [Google Scholar]
- 16.Edelsbrunner, H., Nikitenko, A., Reitzner, M.: Expected sizes of Poisson-Delaunay mosaics and their discrete Morse functions. Adv. Appl. Probab. 49(3), 745–767 (2017) [Google Scholar]
- 17.Edelsbrunner, H., Nikitenko, A., Osang, G.: A step in the Delaunay mosaic of order k. J. Geom. 112, 1–14 (2021) [DOI] [PMC free article] [PubMed] [Google Scholar]
- 18.Flatto, L., Newman, D.J.: Random coverings. Acta Math. 138(1), 241–264 (1977) [Google Scholar]
- 19.Gershkovich, V., Rubinstein, H.: Morse theory for Min-type functions. Asian J. Math. 1(4), 696–715 (1997) [Google Scholar]
- 20.Haenggi, M., Andrews, J.G., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009) [Google Scholar]
- 21.Hall, P.: On the coverage of k-dimensional space by k-dimensional spheres. Ann. Probab. 13(3), 991–1002 (1985) [Google Scholar]
- 22.Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002) [Google Scholar]
- 23.Janson, S.: Random coverings in several dimensions. Acta Math. 156(1), 83–118 (1986) [Google Scholar]
- 24.Lee, D.-T.: On k-nearest neighbor voronoi diagrams in the plane. IEEE Trans. Comput. 100(6), 478–487 (1982) [Google Scholar]
- 25.Miles, R.E.: Isotropic random simplices. Adv. Appl. Probab. 3(2), 353–382 (1971) [Google Scholar]
- 26.Milnor, J.W.: Morse Theory, vol. 51. Princeton University Press, Princeton, New Jersey (1963) [Google Scholar]
- 27.Moran, P.A., St Groth, S.F.: Random circles on a sphere. Biometrika, 389–396 (1962)
- 28.Penrose, M.D.: Random Euclidean coverage from within. Probab. Theory Relat. Fields 185(3–4), 747–814 (2023) [Google Scholar]
- 29.Reani, Y., Bobrowski, O.: A coupled alpha complex. J. Comput. Geom. 14(1), 221–256 (2023) [Google Scholar]
- 30.Schneider, R., Weil, W.: Stochastic and Integral Geometry. Springer, Berlin, Heidelberg (2008) [Google Scholar]
- 31.Shamos, M.I., Hoey, D.: Closest-point problems. In: 16th Annual Symposium on Foundations of Computer Science (sfcs 1975), 151–162 (1975). IEEE
- 32.Sheehy, D.R.: A multicover nerve for geometric inference. In: CCCG, pp. 309–314 (2012)
- 33.Wang, B.: Coverage problems in sensor networks: A survey. ACM Comput. Surv. (CSUR) 43(4), 1–53 (2011) [Google Scholar]
- 34.Zhigljavsky, A., Zilinskas, A.: Stoch. Glob. Optim., vol. 9. Springer, New York, NY (2007) [Google Scholar]
- 35.Zomorodian, A., Carlsson, G.: Computing persistent homology. Discret. Comput. Geom. 33(2), 249–274 (2004) [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
This research has no associated data.
