scholarly journals Using a Neighbourhood Graph Based on Voronoï Tessellation with DMOS, a Generic Method for Structured Document Recognition

2006 ◽  
pp. 267-278 ◽  
Author(s):  
Aurélie Lemaitre ◽  
Bertrand Coüasnon ◽  
Ivan Leplumey
Keyword(s):  
Voronoi Tessellation ◽  
Document Recognition ◽  
Structured Document ◽  
Neighbourhood Graph

Correction: Robust metric aligned quad-dominant meshing using Lp centroidal Voronoi tessellation

2018 ◽  
Author(s):  
Dirk Ekelschot ◽  
Marco Ceze ◽  
Anirban Garai ◽  
Scott M. Murman
Keyword(s):  
Voronoi Tessellation ◽  
Centroidal Voronoi Tessellation

scholarly journals An optical observational cluster mass function at z ∼ 1 with the ORELSE survey

2021 ◽  
Vol 502 (3) ◽  
pp. 3942-3954
Author(s):  
D Hung ◽  
B C Lemaux ◽  
R R Gal ◽  
A R Tomczak ◽  
L M Lubin ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Large Scale ◽  
Near Infrared ◽  
Function Analysis ◽  
Voronoi Tessellation ◽  
Cosmological Parameters ◽  
Mass Range ◽  
Mass Function ◽  
Cluster Mass ◽  
Theoretical Mass

ABSTRACT We present a new mass function of galaxy clusters and groups using optical/near-infrared (NIR) wavelength spectroscopic and photometric data from the Observations of Redshift Evolution in Large-Scale Environments (ORELSE) survey. At z ∼ 1, cluster mass function studies are rare regardless of wavelength and have never been attempted from an optical/NIR perspective. This work serves as a proof of concept that z ∼ 1 cluster mass functions are achievable without supplemental X-ray or Sunyaev-Zel’dovich data. Measurements of the cluster mass function provide important contraints on cosmological parameters and are complementary to other probes. With ORELSE, a new cluster finding technique based on Voronoi tessellation Monte Carlo (VMC) mapping, and rigorous purity and completeness testing, we have obtained ∼240 galaxy overdensity candidates in the redshift range 0.55 < z < 1.37 at a mass range of 13.6 < log (M/M⊙) < 14.8. This mass range is comparable to existing optical cluster mass function studies for the local universe. Our candidate numbers vary based on the choice of multiple input parameters related to detection and characterization in our cluster finding algorithm, which we incorporated into the mass function analysis through a Monte Carlo scheme. We find cosmological constraints on the matter density, Ωm, and the amplitude of fluctuations, σ8, of $\Omega _{m} = 0.250^{+0.104}_{-0.099}$ and $\sigma _{8} = 1.150^{+0.260}_{-0.163}$. While our Ωm value is close to concordance, our σ8 value is ∼2σ higher because of the inflated observed number densities compared to theoretical mass function models owing to how our survey targeted overdense regions. With Euclid and several other large, unbiased optical surveys on the horizon, VMC mapping will enable optical/NIR cluster cosmology at redshifts much higher than what has been possible before.

scholarly journals Modeling the microstructure of biopolymer aerogels using Voronoi tessellation method

PAMM ◽  
2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Rajesh Chandrasekaran ◽  
Markus Hillgärtner ◽  
Ameya Rege ◽  
Barbara Milow ◽  
Mikhail Itskov
Keyword(s):  
Voronoi Tessellation

scholarly journals Optimal Random Packing of Spheres and Extremal Effective Conductivity

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova
Keyword(s):  
Effective Conductivity ◽  
Dimensional Space ◽  
Elementary Function ◽  
Voronoi Tessellation ◽  
Random Packing ◽  
Periodicity Cell ◽  
Algebraic Equations ◽  
Optimal Packing ◽  
Linear Algebraic Equations ◽  
Initial Location

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.

scholarly journals Design and Mechanical Properties Verification of Gradient Voronoi Scaffold for Bone Tissue Engineering

Micromachines ◽  
2021 ◽  
Vol 12 (6) ◽  
pp. 664
Author(s):  
Haiyuan Zhao ◽  
Yafeng Han ◽  
Chen Pan ◽  
Ding Yang ◽  
Haotian Wang ◽  
...  
Keyword(s):  
Mechanical Property ◽  
Tissue Engineering ◽  
Elastic Modulus ◽  
Porous Structure ◽  
Bone Tissue Engineering ◽  
Bone Tissue ◽  
Voronoi Tessellation ◽  
Impact Resistance ◽  
Natural Bone ◽  
The Impact

In order to obtain scaffold that can meet the therapeutic effect, researchers have carried out research on irregular porous structures. However, there are deficiencies in the design method of accurately controlling the apparent elastic modulus of the structure at present. Natural bone has a gradient porous structure. However, there are few studies on the mechanical property advantages of gradient bionic bone scaffold. In this paper, an improved method based on Voronoi-tessellation is proposed. The method can get controllable gradient scaffolds to fit the modulus of natural bone, and accurately control the apparent elastic modulus of porous structure, which is conducive to improving the stress shielding. To verify the designed structure can be fabricated by additive manufacturing, several designed models are obtained by SLM and EBM. Through finite element analysis (FEA), it is verified that the irregular porous structure based on Voronoi-tessellation is more stable than the traditional regular porous structure of the same structure volume, the same pore number and the same material. Furthermore, it is verified that the gradient irregular structure has a better stability than the non-gradient structure. An experiment is conducted successfully to verify the stability performance got by FEA. In addition, a dynamic impact FEA is also performed to simulate impact resistance. The result shows that the impact resistance of the regular porous structure, the irregular porous structure and the gradient irregular porous structure becomes better in turn. The mechanical property verification provides a theoretical basis for the structural design of gradient irregular porous bone tissue engineering scaffolds.

Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks

2000 ◽  
Vol 32 (01) ◽  
pp. 1-18 ◽  
Author(s):  
F. Baccelli ◽  
K. Tchoumatchenko ◽  
S. Zuyev
Keyword(s):  
Communication Networks ◽  
Mobile Networks ◽  
Path Length ◽  
Euclidean Distance ◽  
Voronoi Tessellation ◽  
Voronoi Cells ◽  
Ergodic Properties ◽  
Potential Applications ◽  
The Mean ◽  
Mobile Communication Networks

Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of simple incremental algorithms for constructing short paths on the Delaunay graph and discuss potential applications to routeing in mobile communication networks.

scholarly journals Expressiveness of structured document query languages based on attribute grammars

2002 ◽  
Vol 49 (1) ◽  
pp. 56-100 ◽  
Author(s):  
Frank Neven ◽  
Jan Van Den Bussche
Keyword(s):  
Query Languages ◽  
Attribute Grammars ◽  
Structured Document

An automated system for document recognition

1989 ◽  
Vol 2 (2) ◽  
pp. 120-130
Author(s):  
Wei-Chung Lin ◽  
Yu-Jen Eugene Feng
Keyword(s):  
Automated System ◽  
Document Recognition
Sign in / Sign up

Export Citation Format

Share Document