Computing the volume of a union of balls

2011 ◽  
Vol 38 (1) ◽  
pp. 1-20 ◽  
Author(s):  
Frederic Cazals ◽  
Harshad Kanhere ◽  
Sébastien Loriot
Keyword(s):  
1998 ◽  
Vol 20 (4) ◽  
pp. 449-461 ◽  
Author(s):  
B. Csikós
Keyword(s):  

1998 ◽  
Vol 30 (03) ◽  
pp. 628-639 ◽  
Author(s):  
Mathew D. Penrose

Let n points be placed independently in ν-dimensional space according to the standard ν-dimensional normal distribution. Let M n be the longest edge-length of the minimal spanning tree on these points; equivalently let M n be the infimum of those r such that the union of balls of radius r/2 centred at the points is connected. We show that the distribution of (2 log n)1/2 M n - b n converges weakly to the Gumbel (double exponential) distribution, where b n are explicit constants with b n ~ (ν - 1)log log n. We also show the same result holds if M n is the longest edge-length for the nearest neighbour graph on the points.


1995 ◽  
Vol 13 (3-4) ◽  
pp. 415-440 ◽  
Author(s):  
H. Edelsbrunner
Keyword(s):  

2015 ◽  
Vol 25 (03) ◽  
pp. 187-205 ◽  
Author(s):  
Niccolò Cavazza ◽  
Massimo Ferri ◽  
Claudia Landi

An exact computation of the persistent Betti numbers of a submanifold [Formula: see text] of a Euclidean space is possible only in a theoretical setting. In practical situations, only a finite sample of [Formula: see text] is available. We show that, under suitable density conditions, it is possible to estimate the multidimensional persistent Betti numbers of [Formula: see text] from the ones of a union of balls centered on the sample points; this even yields the exact value in restricted areas of the domain. Using these inequalities we improve a previous lower bound for the natural pseudodistance to assess dissimilarity between the shapes of two objects from a sampling of them. Similar inequalities are proved for the multidimensional persistent Betti numbers of the ball union and the one of a combinatorial description of it.


2010 ◽  
Vol 12 (04) ◽  
pp. 537-567
Author(s):  
DAESHIK PARK

Fix a finite K-symmetric set [Formula: see text] and a K-symmetric probability vector [Formula: see text]. Let 𝔇v be a finite union of balls [Formula: see text] for some ah ∈ Kv and some [Formula: see text], where the balls 𝔅(ah, rh) are disjoint from 𝔛. Put 𝔈v := 𝔇v ∩ ℙ1(Kv). Then there exists a positive integer Nv such that for each sufficiently large integer N divisible by Nv, there are a number Rv, with [Formula: see text], and an [Formula: see text]-function fv(z) ∈ Kv(z) of degree N whose zeros form a "well-distributed" sequence in 𝔈v such that [Formula: see text] is a disjoint union of balls centered at the zeros of fv(z) and for all z ∉ 𝔇v, [Formula: see text]


2004 ◽  
Vol 36 (02) ◽  
pp. 340-354 ◽  
Author(s):  
Antonio Cuevas ◽  
Alberto Rodríguez-Casal

We consider the problem of estimating the boundary of a compact set S ⊂ ℝ d from a random sample of points taken from S. We use the Devroye-Wise estimator which is a union of balls centred at the sample points with a common radius (the smoothing parameter in this problem). A universal consistency result, with respect to the Hausdorff metric, is proved and convergence rates are also obtained under broad intuitive conditions of a geometrical character. In particular, a shape condition on S, which we call expandability, plays an important role in our results. The simple structure of the considered estimator presents some practical advantages (for example, the computational identification of the boundary is very easy) and makes this problem quite close to some basic issues in stochastic geometry.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Ke Yan ◽  
Bing Wang ◽  
Holun Cheng ◽  
Zhiwei Ji ◽  
Jing Huang ◽  
...  

Molecular skin surface (MSS), proposed by Edelsbrunner, is a C2 continuous smooth surface modeling approach of biological macromolecules. Compared to the traditional methods of molecular surface representations (e.g., the solvent exclusive surface), MSS has distinctive advantages including having no self-intersection and being decomposable and transformable. For further promoting MSS to the field of bioinformatics, transformation between different MSS representations mimicking the macromolecular dynamics is demanded. The transformation process helps biologists understand the macromolecular dynamics processes visually in the atomic level, which is important in studying the protein structures and binding sites for optimizing drug design. However, modeling the transformation between different MSSs suffers from high computational cost while the traditional approaches reconstruct every intermediate MSS from respective intermediate union of balls. In this study, we propose a novel computational framework named general MSS transformation framework (GMSSTF) between two MSSs without the assistance of union of balls. To evaluate the effectiveness of GMSSTF, we applied it on a popular public database PDB (Protein Data Bank) and compared the existing MSS algorithms with and without GMSSTF. The simulation results show that the proposed GMSSTF effectively improves the computational efficiency and is potentially useful for macromolecular dynamic simulations.


Sign in / Sign up

Export Citation Format

Share Document