Related papers: Non-simplicial Delaunay meshing via approximation …

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…

I present a generalization of Chew's first algorithm for Delaunay mesh refinement. In his algorithm, Chew splits the line segments of the input planar straight line graph (PSLG) into shorter subsegments whose lengths are nearly identical.…

Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of…

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

We show how a filtration of Delaunay complexes can be used to approximate the persistence diagram of the distance to a point set in $R^d$. Whereas the full Delaunay complex can be used to compute this persistence diagram exactly, it may…

We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…

A family of embedded rotationally symmetric tori in the Euclidean 3-space consisting of two opposite signed constant mean curvature surfaces that converge as varifolds to a double round sphere is constructed. Using complete elliptic…

Voronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly…

We present a novel structure-preserving semi-implicit finite volume method on vertex-based staggered meshes for the compatible discretization of first order systems of time-dependent partial differential equations (PDEs). The method…

We propose a model for nonlinearly elastic membranes undergoing finite deformations while confined to a regular frictionless surface in $\mathbb{R}^3$. This is a physically correct model of the analogy sometimes given to motivate harmonic…

Given a sequence of finite element spaces which form a de Rham sequence, we will construct a dual representation of these spaces with associated differential operators which connect these spaces such that they also form a de Rham sequence.…

We present a derivation of the exact expression for Pulay forces in density-functional theory calculations augmented with extended Hubbard functionals, and arising from the use of orthogonalized atomic orbitals as projectors for the Hubbard…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

We present an analytically explicit study of optimal discrete quantization on spherical geometries equipped with the geodesic metric, focusing on highly symmetric configurations on the unit sphere $\mathbb S^2$. Three discrete uniform…

Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…

The finite element solution of two-dimensional anisotropic diffusion problems is considered. A Delaunay-type mesh condition is developed for linear finite element approximations to satisfy a discrete maximum principle. The condition is…

We study hypersurfaces of $\mathbb{R}^N$ with constant nonlocal (or fractional) mean curvature. This is the equation associated to critical points of the fractional perimeter functional under a volume constraint. We establish the existence…

Any system of bisectors (in the sense of abstract Voronoi diagrams) defines an arrangement of simple curves in the plane. We define Voronoi-like graphs on such an arrangement, which are graphs whose vertices are locally Voronoi. A vertex…

We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct…

We study the Dirichlet problem for the following prescribed mean curvature PDE $$ \begin{cases} -\operatorname{div}\dfrac{\nabla v}{\sqrt{1+|\nabla v|^{2}}}=f(x,v) \text{ in }\Omega\\ v=\varphi \text{ on }\partial\Omega. \end{cases} $$…