oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Cluster identification via Voronoi tessellation  [PDF]
M. Ramella,M. Nonino,W. Boschin,D. Fadda
Physics , 1998,
Abstract: We propose an automated method for detecting galaxy clusters in imaging surveys based on the Voronoi tessellation technique. It appears very promising, expecially for its capability of detecting clusters indipendently from their shape. After a brief explanation of our use of the algorithm, we show here an example of application based on a strip of the ESP Key Programme complemented with galaxies of the COSMOS/UKST Southern Sky Catalogue supplied by the Anglo- Australian Observatory.
ON THE DILATED FACETS OF A POISSON-VORONOI TESSELLATION
Claudia Redenbach
Image Analysis and Stereology , 2011, DOI: 10.5566/ias.v30.p31-38
Abstract: In this paper, the parallel set ΞR of the facets ((d 1)-faces) of a stationary Poisson-Voronoi tessellation in 2 and 3 is investigated. An analytical formula for the spherical contact distribution function of the tessellation allows for the derivation of formulae for the volume density and the specific surface area of ΞR. The densities of the remaining intrinsic volumes are studied by simulation. The results are used for fitting a dilated Poisson-Voronoi tessellation to the microstructure of a closed-cell foam.
Anchored expansion, speed, and the hyperbolic Poisson Voronoi tessellation  [PDF]
Itai Benjamini,Elliot Paquette,Joshua Pfeffer
Mathematics , 2014,
Abstract: We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic Poisson Delaunay triangulation, have 1-skeletons with positive anchored expansion. As a consequence, we show that the simple random walks on these graphs have positive speed. We include a section of open problems and conjectures on the topics of stationary geometric random graphs and the hyperbolic Poisson Voronoi tessellation.
A dynamical system using the Voronoi tessellation  [PDF]
Natalie Priebe Frank,Sean Hart
Mathematics , 2007,
Abstract: We introduce a dynamical system based on the vertices of Voronoi tessellations. This dynamical system acts on finite or discrete point sets in the plane, taking a point set to the vertex set of its Voronoi tessellation. We explore the behavior of this system for small point sets, then prove a general result quantifying the growth of the sizes of the point sets under iteration. We conclude by giving the most interesting open problems.
The Voronoi Tessellation cluster finder in 2+1 dimensions  [PDF]
Marcelle Soares-Santos,Reinaldo R. de Carvalho,James Annis,Roy R. Gal,Francesco La Barbera,Paulo A. A. Lopes,Risa H. Wechsler,Michael T. Busha,Brian F. Gerke
Physics , 2010, DOI: 10.1088/0004-637X/727/1/45
Abstract: We present a detailed description of the Voronoi Tessellation (VT) cluster finder algorithm in 2+1 dimensions, which improves on past implementations of this technique. The need for cluster finder algorithms able to produce reliable cluster catalogs up to redshift 1 or beyond and down to $10^{13.5}$ solar masses is paramount especially in light of upcoming surveys aiming at cosmological constraints from galaxy cluster number counts. We build the VT in photometric redshift shells and use the two-point correlation function of the galaxies in the field to both determine the density threshold for detection of cluster candidates and to establish their significance. This allows us to detect clusters in a self consistent way without any assumptions about their astrophysical properties. We apply the VT to mock catalogs which extend to redshift 1.4 reproducing the $\Lambda$CDM cosmology and the clustering properties observed in the SDSS data. An objective estimate of the cluster selection function in terms of the completeness and purity as a function of mass and redshift is as important as having a reliable cluster finder. We measure these quantities by matching the VT cluster catalog with the mock truth table. We show that the VT can produce a cluster catalog with completeness and purity $>80%$ for the redshift range up to $\sim 1$ and mass range down to $\sim 10^{13.5}$ solar masses.
Voronoi Tessellation and Non-parametric Halo Concentration  [PDF]
Meagan Lang,Kelly Holley-Bockelmann,Manodeep Sinha
Physics , 2015, DOI: 10.1088/0004-637X/811/2/152
Abstract: We present and test TesseRACt, a non-parametric technique for recovering the concentration of simulated dark matter halos using Voronoi tessellation. TesseRACt is tested on idealized N-body halos that are axisymmetric, triaxial, and contain substructure and compared to traditional least-squares fitting as well as two non-parametric techniques that assume spherical symmetry. TesseRACt recovers halo concentrations within 0.3% of the true value regardless of whether the halo is spherical, axisymmetric, or triaxial. Traditional fitting and non-parametric techniques that assume spherical symmetry can return concentrations that are systematically off by as much as 10% from the true value for non-spherical halos. TesseRACt also performs significantly better when there is substructure present outside $0.5R_{200}$. Given that cosmological halos are rarely spherical and often contain substructure, we discuss implications for studies of halo concentration in cosmological N-body simulations including how choice of technique for measuring concentration might bias scaling relations.
Extreme values for characteristic radii of a Poisson-Voronoi tessellation  [PDF]
Pierre Calka,Nicolas Chenavier
Mathematics , 2013,
Abstract: A homogeneous Poisson-Voronoi tessellation of intensity $\gamma$ is observed in a convex body $W$. We associate to each cell of the tessellation two characteristic radii: the inradius, i.e. the radius of the largest ball centered at the nucleus and included in the cell, and the circumscribed radius, i.e. the radius of the smallest ball centered at the nucleus and containing the cell. We investigate the maximum and minimum of these two radii over all cells with nucleus in $W$. We prove that when $\gamma\rightarrow\infty$, these four quantities converge to Gumbel or Weibull distributions up to a rescaling. Moreover, the contribution of boundary cells is shown to be negligible. Such approach is motivated by the analysis of the global regularity of the tessellation. In particular, consequences of our study include the convergence to the simplex shape of the cell with smallest circumscribed radius and an upper-bound for the Hausdorff distance between $W$ and its so-called Poisson-Voronoi approximation.
Finding Clusters of Galaxies in the Sloan Digital Sky Survey using Voronoi Tessellation  [PDF]
Rita S. J. Kim,Michael A. Strauss,Neta A. Bahcall,James E. Gunn,Robert H. Lupton,Wolfgang Voges,Michael S. Vogeley,David Schlegel,for the SDSS collaboration
Physics , 1999,
Abstract: The Sloan Digital Sky Survey has obtained 450 square degrees of photometric scan data, in five bands (u',g',r',i',z'), which we use to identify clusters of galaxies. We illustrate how we do star-galaxy separation, and present a simple and elegant method of detecting overdensities in the galaxy distribution, using the Voronoi Tessellation.
On the measure of Voronoi cells  [PDF]
Luc Devroye,László Gy?rfi,Gábor Lugosi,Harro Walk
Statistics , 2015,
Abstract: $n$ independent random points drawn from a density $f$ in $R^d$ define a random Voronoi partition. We study the measure of a typical cell of the partition. We prove that the asymptotic distribution of the probability measure of the cell centered at a point $x \in R^d$ is independent of $x$ and the density $f$. We determine all moments of the asymptotic distribution and show that the distribution becomes more concentrated as $d$ becomes large. In particular, we show that the variance converges to zero exponentially fast in $d$. %We also study the measure of the largest cell of the partition. %{\red We also obtain a density-free bound for the rate of convergence of the diameter of a typical Voronoi cell.
The Forest Method as a New Parallel Tree Method with the Sectional Voronoi Tessellation  [PDF]
H. Yahagi,M. Mori,Y. Yoshii
Physics , 1999, DOI: 10.1086/313250
Abstract: We have developed a new parallel tree method which will be called the forest method hereafter. This new method uses the sectional Voronoi tessellation (SVT) for the domain decomposition. The SVT decomposes a whole space into polyhedra and allows their flat borders to move by assigning different weights. The forest method determines these weights based on the load balancing among processors by means of the over-load diffusion (OLD). Moreover, since all the borders are flat, before receiving the data from other processors, each processor can collect enough data to calculate the gravity force with precision. Both the SVT and the OLD are coded in a highly vectorizable manner to accommodate on vector parallel processors. The parallel code based on the forest method with the Message Passing Interface is run on various platforms so that a wide portability is guaranteed. Extensive calculations with 15 processors of Fujitsu VPP300/16R indicate that the code can calculate the gravity force exerted on 10^5 particles in each second for some ideal dark halo. This code is found to enable an N-body simulation with 10^7 or more particles for a wide dynamic range and is therefore a very powerful tool for the study of galaxy formation and large-scale structure in the universe.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.