Logarithmic Voronoi cells

Yulia Alexandr; Alexander Heaton

doi:10.2140/astat.2021.12.75

Typical Voronoi cells for Cox point processes on Manhattan grids

2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT) ◽

10.23919/wiopt47501.2019.9144122 ◽

2019 ◽

Author(s):

A. Hinsen ◽

C. Hirsch ◽

B. Jahnel ◽

E. Cali

Keyword(s):

Point Processes ◽

Voronoi Cells

Download Full-text

On farthest Bregman Voronoi cells

Optimization ◽

10.1080/02331934.2021.1915313 ◽

2021 ◽

pp. 1-11

Author(s):

Juan Enrique Martínez-Legaz ◽

Maryam Tamadoni Jahromi ◽

Eskandar Naraghirad

Keyword(s):

Voronoi Cells

Download Full-text

Tetrahedra of varying density and their applications

The Visual Computer ◽

10.1007/s00371-021-02189-0 ◽

2021 ◽

Author(s):

Dennis R. Bukenberger ◽

Hendrik P. A. Lensch

Keyword(s):

Tetrahedral Mesh ◽

Rotational Inertia ◽

Exact Mass ◽

Accurate Analysis ◽

Exact Integration ◽

Voronoi Cells ◽

Current State ◽

Chebyshev Norm ◽

Exact Calculations ◽

Vector Matrix

Abstract We propose concepts to utilize basic mathematical principles for computing the exact mass properties of objects with varying densities. For objects given as 3D triangle meshes, the method is analytically accurate and at the same time faster than any established approximation method. Our concept is based on tetrahedra as underlying primitives, which allows for the object’s actual mesh surface to be incorporated in the computation. The density within a tetrahedron is allowed to vary linearly, i.e., arbitrary density fields can be approximated by specifying the density at all vertices of a tetrahedral mesh. Involved integrals are formulated in closed form and can be evaluated by simple, easily parallelized, vector-matrix multiplications. The ability to compute exact masses and centroids for objects of varying density enables novel or more exact solutions to several interesting problems: besides the accurate analysis of objects under given density fields, this includes the synthesis of parameterized density functions for the make-it-stand challenge or manufacturing of objects with controlled rotational inertia. In addition, based on the tetrahedralization of Voronoi cells we introduce a precise method to solve $$L_{2|\infty }$$ L 2 | ∞ Lloyd relaxations by exact integration of the Chebyshev norm. In the context of additive manufacturing research, objects of varying density are a prominent topic. However, current state-of-the-art algorithms are still based on voxelizations, which produce rather crude approximations of masses and mass centers of 3D objects. Many existing frameworks will benefit by replacing approximations with fast and exact calculations. Graphic abstract

Download Full-text

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

Advances in Applied Probability ◽

10.1017/s0001867800009733 ◽

2000 ◽

Vol 32 (01) ◽

pp. 1-18 ◽

Cited By ~ 5

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.

Download Full-text