Related papers: Properties of the Delaunay Triangulation
We consider in this work triangulations of $\mathbb{Z}^n$ that are periodic along $\mathbb{Z}^n$. They generalize the triangulations obtained from Delaunay tessellations of lattices. Other important property is the regularity and…
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
The optimization of shape functionals under convexity, diameter or constant width constraints shows numerical challenges. The support function can be used in order to approximate solutions to such problems by finite dimensional optimization…
Among all triangles of given diameter, the equilateral triangle is shown to minimize the sum of the first $n$ eigenvalues of the Dirichlet Laplacian, for each $n \geq 1$. In addition, the first, second and third eigenvalues are each proved…
Benjamini and Schramm (1996) used circle packing to prove that every transient, bounded degree planar graph admits non-constant harmonic functions of finite Dirichlet energy. We refine their result, showing in particular that for every…
We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set $P$ of $n$ points in the plane and a triangulation $G$ that serves as a…
The set B of geodesic rays avoiding a suitable obstacle in a complete negatively curved Riemannian manifold determines a spectrum S. While various properties of this spectrum are known, we define and study dimension functions on S in terms…
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…
In this paper, we give a geometric interpretation of optimal functionals in the context of intersection of symmetry planes and cyclic polytopes. For 1D CFTs, we demonstrate that at given derivative order, the functional is given by a…
The local angle property of the (order-$1$) Delaunay triangulations of a generic set in $\mathbb{R}^2$ asserts that the sum of two angles opposite a common edge is less than $\pi$. This paper extends this property to higher order and uses…
We consider the functional given by the product of the first Dirichlet eigenvalue and the torsional rigidity of planar domains normalized by the area. This scale invariant functional was studied by P\'olya and Szeg\H{o} in 1951 who showed…
An open Riemann surface is called parabolic in case every bounded subharmonic function on it reduces to a constant. Several authors introduced seemingly different analogs of this notion for Stein manifolds of arbitrary dimension. In the…
We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the…
The parabolic functions are introduced in analogy to the circular and hyperbolic cases. We discuss the relevant properties, the geometrical interpretation and touch on possible generalizations and their link with the modular elliptic…
An application of dimensional reduction results for gradient constrained problems is provided for 3D-2D dimension reduction for supremal functionals, in the case when the domain is convex.
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…
Dimensional analysis provides many simple and useful tools for various situations in science. The objective of this paper is to investigate its relations to functions, i.e., the dimensions for functions that yield physical quantities and…
The construction of anisotropic triangulations is desirable for various applications, such as the numerical solving of partial differential equations and the representation of surfaces in graphics. To solve this notoriously difficult…
Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…
We prove a uniform upper and lower bound for Delannoy numbers. This is achieved by using the representation of Delannoy numbers as the number of lattice points in high-dimensional cross-polytopes (also known as hyper-octahedrons or $\ell^1$…