English
Related papers

Related papers: Voronoi tessellations for matchbox manifolds

200 papers

Many methods for modelling spatial processes assume global smoothness properties; such assumptions are often violated in practice. We introduce a method for modelling spatial processes that display heterogeneity or contain discontinuities.…

Real complex networks are often characterized by spatial constraints such as the relative position and adjacency of nodes. The present work describes how Voronoi tessellations of the space where the network is embedded provide not only a…

Condensed Matter · Physics 2009-11-10 Luciano da Fontoura Costa

Bandyopadhyay, Dacorogna, Matveev and Troyanov conjectured that a closed manifold admitting a flat, non-negative definite metric of constant rank $m$ should be finitely covered by a fiber bundle over the $m$-torus. We give a counter-example…

Differential Geometry · Mathematics 2025-01-29 Brice Flamencourt

This work introduces the Hookean-Voronoi energy, a minimal model for the packing of soft, deformable balls. This is motivated by recent studies of quasi-periodic equilibria arising from dense packings of diblock and star polymers.…

Soft Condensed Matter · Physics 2023-01-25 Kenneth Jao , Keith Promislow , Samuel Sottile

The Voronoi diagram is a geometric object which is widely used in many areas. Recently it has been shown that under mild conditions Voronoi diagrams have a certain continuity property: small perturbations of the sites yield small…

Computational Geometry · Computer Science 2013-04-30 Daniel Reem

In this paper, we establish a number of results about the topology of the leaves of a closed singular Riemannian foliation $(M,\fol)$. If $M$ is simply connected, we prove that the leaves are finitely covered by nilpotent spaces, and…

Differential Geometry · Mathematics 2022-04-01 Marco Radeschi , Elahe Khalili Samani

In this paper, we present a new approach to obtain symmetric tiles with curved edges. Our approach is based on using higher-order Voronoi sites that are closed under wallpaper symmetries. The resulting Voronoi tessellations provide us with…

Computational Geometry · Computer Science 2023-10-25 Haard Panchal , Ergun Akleman , Vinayak Krishnamurthy , Tolga Talha Yildiz , Varda Grover

The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern "random", Poisson-Voronoi tessellations (PVT), or "non-random", Non Poisson-Voronoi…

Data Analysis, Statistics and Probability · Physics 2015-11-23 M. Ferraro , L. Zaninetti

Topology optimization is able to maximally leverage the high DOFs and mechanical potentiality of porous foams but faces three fundamental challenges: conforming to free-form outer shapes, maintaining geometric connectivity between adjacent…

Graphics · Computer Science 2023-08-09 Ming Li , Jingqiao Hu , Wei Chen , Weipeng Kong , Jin Huang

It is proved that the isometry classes of pointed connected complete Riemannian $n$-manifolds form a Polish space, $\mathcal{M}_*^\infty(n)$, with the topology described by the $C^\infty$ convergence of manifolds. This space has a canonical…

Geometric Topology · Mathematics 2016-12-14 Jesús A. Álvarez López , Ramón Barral Lijó , Alberto Candel

A transitive compact foliated space is shown to be a Riemannian foliation if and only if it is locally connected, finite dimensional, strongly equicontinuous and quasi-analytic, and the closure of its holonomy pseudogroup is quasi-analytic.

Geometric Topology · Mathematics 2013-11-15 Jesús A. Álvarez López , Alberto Candel

High energy experimental data can be viewed as a sampling of the relevant phase space. We point out that one can apply Voronoi tessellations in order to understand the underlying probability distributions in this phase space. Interesting…

High Energy Physics - Phenomenology · Physics 2015-11-10 Dipsikha Debnath , James S. Gainer , Doojin Kim , Konstantin T. Matchev

Voronoi Tessellations form an attractive and versatile geometrical asymptotic model for the foamlike cosmic distribution of matter and galaxies. In the Voronoi model the vertices are identified with clusters of galaxies. For a substantial…

Astrophysics · Physics 2007-05-23 Rien van de Weygaert

In this paper we investigate relationships between the volumes of cells of three-dimensional Voronoi tessellations and the lengths and areas of sections obtained by intersecting the tessellation with a randomly oriented plane. Here, in…

Statistical Mechanics · Physics 2011-10-12 L. Zaninetti , M. Ferraro

We present an algorithm for producing Delaunay triangulations of manifolds. The algorithm can accommodate abstract manifolds that are not presented as submanifolds of Euclidean space. Given a set of sample points and an atlas on a compact…

Computational Geometry · Computer Science 2015-05-07 Jean-Daniel Boissonnat , Ramsay Dyer , Arijit Ghosh

We consider the construction of a polyhedral Delaunay partition as a limit of the sequence of power diagrams (radical partitions). The dual Voronoi diagram is obtained as a limit of the sequence of weighted Delaunay partitions. The problem…

Numerical Analysis · Mathematics 2023-11-15 Vladimir Garanzha , Liudmila Kudryavtseva , Lennard Kamenski

The lecture notes describe the Delaunay Tessellation Field Estimator for Cosmic Web analysis. The high sensitivity of Voronoi/Delaunay tessellations to the local point distribution is used to obtain estimates of density and related…

Astrophysics · Physics 2017-03-08 Rien van de Weygaert , Willem Schaap

We review the concepts of the Voronoi binning technique (Cappellari & Copin 2003), which optimally solves the problem of preserving the maximum spatial resolution of general two-dimensional data, given a constraint on the minimum…

Instrumentation and Methods for Astrophysics · Physics 2009-12-08 Michele Cappellari

Navigating topological transitions in cellular mechanical systems is a significant challenge for existing simulation methods. While abstract models lack predictive capabilities at the cellular level, explicit network representations…

Graphics · Computer Science 2024-04-30 Logan Numerow , Yue Li , Stelian Coros , Bernhard Thomaszewski

We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough. An important implication of this result is that…

Computational Geometry · Computer Science 2019-10-11 Ahmad Biniaz