English
Related papers

Related papers: Average and Expected Distortion of Voronoi Paths a…

200 papers

Diffusion-driven patterns appear on curved surfaces in many settings, initiated by unstable modes of an underlying Laplacian operator. On a flat surface or perfect sphere, the patterns are degenerate, reflecting translational/rotational…

Soft Condensed Matter · Physics 2025-09-09 John R. Frank , Jemal Guven , Mehran Kardar , Leyna Shackleton

The Vapnik-Chervonenkis (VC) dimension of the set of half-spaces of R^d with frontiers parallel to the axes is computed exactly. It is shown that it is much smaller than the intuitive value of d. A good approximation based on the Stirling's…

Statistics Theory · Mathematics 2016-10-21 Servane Gey

A hex sphere is a singular Euclidean sphere with four cones points whose cone angles are (integer) multiples of 2*pi/3 but less than 2*pi. Given a hex sphere M, we consider its Voronoi decomposition centered at the two cone points with…

Geometric Topology · Mathematics 2010-11-01 Aldo-Hilario Cruz-Cota

An old theorem, due to Graustein, asserts that the average curvature of a plane oval is attained at least at four points. We present a proof by way of wave propagation and extend this result to the spherical and hyperbolic geometries - in…

Differential Geometry · Mathematics 2024-09-20 Serge Tabachnikov

Let $(\{1,2,\ldots,n\},d)$ be a metric space. We analyze the expected value and the variance of $\sum_{i=1}^{\lfloor n/2\rfloor}\,d({\boldsymbol{\pi}}(2i-1),{\boldsymbol{\pi}}(2i))$ for a uniformly random permutation ${\boldsymbol{\pi}}$ of…

Data Structures and Algorithms · Computer Science 2017-03-27 Ching-Lueh Chang

The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…

Combinatorics · Mathematics 2011-04-05 Jens Marklof , Andreas Strömbergsson

The discrete Fourier transform is among the most routine tools used in high-resolution scanning / transmission electron microscopy (S/TEM). However, when calculating a Fourier transform, periodic boundary conditions are imposed and sharp…

Image and Video Processing · Electrical Eng. & Systems 2022-10-18 Robert Hovden , Yi Jiang , Huolin L. Xin , Lena F. Kourkoutis

We study local diffusion rate $D$ in Chirikov standard map near the critical golden curve. Numerical simulations confirm the predicted exponent $\alpha=5$ for the power law decay of $D$ as approaching the golden curve via principal…

chao-dyn · Physics 2009-10-28 S. Ruffo , D. L. Shepelyansky

In this paper, we extend the method developed in [17, 18] to curves in the Minkowski plane. The method proposes a way to study deformations of plane curves taking into consideration their geometry as well as their singularities. We deal in…

Differential Geometry · Mathematics 2020-07-10 A. P. Francisco

We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…

Data Structures and Algorithms · Computer Science 2021-06-08 Greg Bodwin , Virginia Vassilevska Williams

On a compact manifold with boundary, the map consisting of the scalar curvature in the interior and the mean curvature on the boundary is a local surjection at generic metrics. We prove that this result may be localized to compact…

Differential Geometry · Mathematics 2025-12-02 Hongyi Sheng

We consider Voronoi's reduction theory of positive definite quadratic forms which is based on Delone subdivision. We extend it to forms and Delone subdivisions having a prescribed symmetry group. Even more general, the theory is developed…

Metric Geometry · Mathematics 2008-04-10 Mathieu Dutour Sikiric , Achill Schuermann , Frank Vallentin

We make progress on three long standing conjectures from the 1960s about path and cycle decompositions of graphs. Gallai conjectured that any connected graph on $n$ vertices can be decomposed into at most $\left\lceil…

Combinatorics · Mathematics 2022-02-09 António Girão , Bertille Granet , Daniela Kühn , Deryk Osthus

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

Computational Geometry · Computer Science 2015-03-23 Sariel Har-Peled , Benjamin Raichel

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of…

Computational Geometry · Computer Science 2010-06-03 Prosenjit Bose , Luc Devroye , Maarten Löffler , Jack Snoeyink , Vishal Verma

We study the Hausdorff measure and dimension of the set of intrinsically simultaneously $\psi$-approximable points on a curve, surface, etc., given as a graph of integer valued polynomials. We obtain complete answers to these questions for…

Number Theory · Mathematics 2019-02-20 Morten Hein Tiljeset

We describe the development of a new software tool, called "Pomelo", for the calculation of Set Voronoi diagrams. Voronoi diagrams are a spatial partition of the space around the particles into separate Voronoi cells, e.g. applicable to…

Data Analysis, Statistics and Probability · Physics 2018-02-16 Simon Weis , Philipp W. A. Schönhöfer , Fabian M. Schaller , Matthias Schröter , Gerd E. Schröder-Turk

It is known that every closed curve of length \leq 4 in R^n (n>0) can be surrounded by a sphere of radius 1, and that this is the best bound. Letting S denote the circle of circumference 4, with the arc-length metric, we here express this…

Metric Geometry · Mathematics 2021-10-15 George M. Bergman

We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\varepsilon$ of edges and $\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\%$ of the possible range…

Combinatorics · Mathematics 2017-03-16 Charles Radin , Kui Ren , Lorenzo Sadun

We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…

Statistical Mechanics · Physics 2009-11-10 Francesca Colaiori , Andrea Baldassarri , Claudio Castellano