Related papers: Proximal Delaunay Triangulation Regions
It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…
There are very few mathematical results governing the interpolation of functions or their gradients on Delaunay meshes in more than two dimensions. Unfortunately, the standard techniques for proving optimal interpolation properties are…
Given a set of disjoint simple polygons $\sigma_1, \ldots, \sigma_n$, of total complexity $N$, consider a convexification process that repeatedly replaces a polygon by its convex hull, and any two (by now convex) polygons that intersect by…
In 1929 B.~N.~Delaunay proved that there are exactly 5 types of coincidence of parallelohedra at faces of codimension 3. We give a combinatorial proof of this theorem and prove several additional statements on three-codimensional faces of…
We show the existence of several new families of non-compact constant mean curvature surfaces: (i) singly-punctured surfaces of arbitrary genus $g \geq 1$, (ii) doubly-punctured tori, and (iii) doubly periodic surfaces with Delaunay ends.
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding.…
We provide a few characterizations of a strictly convex Banach space. Using this we improve the main theorem of [Digar, Abhik; Kosuru, G. Sankara Raju; Cyclic uniform Lipschitzian mappings and proximal uniform normal structure. Ann. Funct.…
A decoration of a hyperbolic surface of finite type is a choice of circle, horocycle or hypercycle about each cone-point, cusp or flare of the surface, respectively. In this article we show that a decoration induces a unique canonical…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no $O(1)$-competitive online routing algorithm exists. A notable exception is the Delaunay…
Let $\Phi$ be an irreducible crystallographic root system and $\mathcal P$ its root polytope, i.e., its convex hull. We provide a uniform construction, for all root types, of a triangulation of the facets of $\mathcal P$. We also prove…
Let $P$ be a collection of $n$ points in the plane, each moving along some straight line at unit speed. We obtain an almost tight upper bound of $O(n^{2+\epsilon})$, for any $\epsilon>0$, on the maximum number of discrete changes that the…
In this paper, we consider the locally convex spaces of entire functions with growth given by proximate orders, and study the representation as a differential operator of a continuous homomorphism from such a space to another one. As a…
The purpose of this paper is to make a comprehensive connection between the basic results and properties derived from the two kinds of topologies (namely the $(\epsilon,\lambda)-$topology introduced by the author and the stronger locally…
We prove that the number of dissections of a given polygon into triangles with fixed areas of faces is finite and that an equidissection is algebraic as long as the vertices of the original polygon have algebraic coordinates.
TD-Delaunay graphs, where TD stands for triangular distance, is a variation of the classical Delaunay triangulations obtained from a specific convex distance function. Bonichon et. al. noticed that every triangulation is the TD-Delaunay…
Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…
We derive parametrizations of the Delaunay constant mean curvature surfaces of revolution that follow directly from parametrizations of the conics that generate these surfaces via the corresponding roulette. This uniform treatment exploits…
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…