Related papers: Proximal Vorono\"i Regions

Many polytopes arising in polyhedral combinatorics are linear projections of higher-dimensional polytopes with significantly fewer facets. Such lifts may yield compressed representations of polytopes, which are typically used to construct…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

We give an intrinsic proof that Vorobjev's first approximation of a Poisson manifold near a symplectic leaf is a Poisson manifold. We also show that Conn's linearization results cannot be extended in Vorobjev's setting.

We study logarithmic Voronoi cells for linear statistical models and partial linear models. The logarithmic Voronoi cells at points on such model are polytopes. To any $d$-dimensional linear model inside the probability simplex…

In this paper we prove a general structure theorem for relatively hyperbolic groups (with arbitrary peripheral subgroups) acting naive convex co-compactly on properly convex domains in real projective space. We also establish 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…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

The Voronoi conjecture on parallelohedra claims that for every convex polytope $P$ that tiles Euclidean $d$-dimensional space with translations there exists a $d$-dimensional lattice such that $P$ and the Voronoi polytope of this lattice…

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…

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth…

Strata of translation surfaces are covered by the closures of finitely many iso-Delaunay regions: open subspaces parametrizing surfaces whose Delaunay triangulations are combinatorially equivalent. We prove that the iso-Delaunay regions for…

We study a properly convex real projective manifold with (possibly empty) compact, strictly convex boundary, and which consists of a compact part plus finitely many convex ends. We extend a theorem of Koszul which asserts that for a compact…

This article introduces a theory of proximal nerve complexes and nerve spokes, restricted to the triangulation of finite regions in the Euclidean plane. A nerve complex is a collection of filled triangles with a common vertex, covering a…

We prove that the universal covering space of a complex projective manifold is holomorphically convex provided its fundamental group is linear.

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms, are fundamental tools for many scientific fields related to computational geometry, and they have been studied for a long time. The PIP algorithms…

It is shown that the area of Voronoi cells for a generalized Archimedean spiral lattice converges under some scale normalization, if the angle parameter is badly approximable.

We give a proof of the existence of radial (smooth) parallel sections of vector bundles endowed with a linear connection.

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

We prove that every polynomially convex arc is contained in a polynomially convex simple closed curve. We also establish results about polynomial hulls of arcs and curves that are locally rectifiable outside a polynomially convex subset.