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.
A zone-based iterative building displacement method through the collective use of Voronoi Tessellation, spatial analysis and multicriteria decision making
Basaraner, Melih;
Boletim de Ciências Geodésicas , 2011, DOI: 10.1590/S1982-21702011000200001
Abstract: an iterative displacement method working based on generalisation zones is proposed as a part of contextual building generalisation in topographic map production at medium scales. displacement is very complicated operation since a compromise ought to be found between several conflicting criteria. displacement requirement mainly arises from the violation of minimum distances imposed by graphic limits after the enlargement of map objects for target scale. it is also important to maintain positional accuracy within scale limits and to propagate the changes to the related neighbouring objects by preserving spatial configurations as far as possible. in the proposed method, first it is decided where and when to initiate building displacement based on spatial analysis in the generalisation zones created for building clusters in the blocks. secondly, relevant criteria are defined to control the displacement. finally displacement candidate and vector are decided by means of voronoi tessellation, spatial analysis techniques and combined multiple criteria (i.e. displacement controls) in each iteration. the evaluation of the findings demonstrates that this method is largely effective in zone-based displacement of buildings.
The Palm measure and the Voronoi tessellation for the Ginibre process  [PDF]
André Goldman
Mathematics , 2006, DOI: 10.1214/09-AAP620
Abstract: We prove that the Palm measure of the Ginibre process is obtained by removing a Gaussian distributed point from the process and adding the origin. We obtain also precise formulas describing the law of the typical cell of Ginibre--Voronoi tessellation. We show that near the germs of the cells a more important part of the area is captured in the Ginibre--Voronoi tessellation than in the Poisson--Voronoi tessellation. Moment areas of corresponding subdomains of the cells are explicitly evaluated.
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.
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.
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.
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.
Gradient of the Objective Function for an Anisotropic Centroidal Voronoi Tessellation (CVT) - A revised, detailed derivation  [PDF]
Giacomo Parigi,Marco Piastra
Computer Science , 2014,
Abstract: In their recent article (2010), Levy and Liu introduced a generalization of Centroidal Voronoi Tessellation (CVT) - namely the Lp-CVT - that allows the computation of an anisotropic CVT over a sound mathematical framework. In this article a new objective function is defined, and both this function and its gradient are derived in closed-form for surfaces and volumes. This method opens a wide range of possibilities, also described in the paper, such as quad-dominant surface remeshing, hex-dominant volume meshing or fully-automated capturing of sharp features. However, in the same paper, the derivations of the gradient and of the new objective function are only partially expanded in the appendices, and some relevant requisites on the anisotropy field are left implicit. In order to better harness the possibilities described there, in this work the entire derivation process is made explicit. In the authors' opinion, this also helps understanding the working conditions of the method and its possible applications.
Page 1 /100
Display every page Item

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