Related papers: Environmental contours as Voronoi cells
Unlike other schemes that locally violate the essential stability properties of the analytic parabolic and elliptic problems, Voronoi finite volume methods (FVM) and boundary conforming Delaunay meshes provide good approximation of the…
Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…
The Voronoi-based cellular model is highly successful in describing the motion of two-dimensional confluent cell tissues. In the homogeneous version of this model, the energy of each cell is determined solely by its geometric shape and…
Insurance risk arising from catastrophes such as earthquakes a component of the Minimum Capital Test for federally regulated property and casualty insurance companies. Analyzing earthquake insurance risk requires well-fitted spatio-temporal…
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…
We study the problem of decomposing a volume bounded by a smooth surface into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained…
Effective transport properties of heterogeneous structures are predicted by geometric microstructural parameters, but these can be difficult to calculate. Here, a boundary element code with a recurrent series method accurately and…
Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…
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…
We consider problem of constructing purely Voronoi mesh where the union of uncut Voronoi cells approximates the planar computational domain with piecewise-smooth boundary. Smooth boundary fragments are approximated by the Voronoi edges and…
The pair correlation function (PCF) has proven an effective tool for analyzing many physical systems due to its simplicity and its applicability to simulated and experimental data. However, as an averaged quantity, the PCF can fail to…
We revisit the classical problem of computing the \emph{contour tree} of a scalar field $f:\mathbb{M} \to \mathbb{R}$, where $\mathbb{M}$ is a triangulated simplicial mesh in $\mathbb{R}^d$. The contour tree is a fundamental topological…
A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…
We consider the Voronoi diagram generated by $n$ i.i.d. $\mathbb{R}^{d}$-valued random variables with an arbitrary underlying probability density function $f$ on $\mathbb{R}^{d}$, and analyse the asymptotic behaviours of certain geometric…
While particle trajectories encode information on their governing potentials, potentials can be challenging to robustly extract from trajectories. Measurement errors may corrupt a particle's position, and sparse sampling of the potential…
We present an extension of Voronoi diagrams where when considering which site a client is going to use, in addition to the site distances, other site attributes are also considered (for example, prices or weights). A cell in this diagram is…
Consider a planar random point process made of the union of a point (the origin) and of a Poisson point process with a uniform intensity outside a deterministic set surrounding the origin. When the intensity goes to infinity, we show that…
We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of…
Hyperuniform materials, characterized by their suppressed density fluctuations and vanishing structure factors as the wave number approaches zero, represent a unique state of matter that straddles the boundary between order and randomness.…
The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define…