Related papers: Polyhedral Voronoi Cells
The geometric kernel (or simply the kernel) of a polyhedron is the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has been largely addressed in the literature, fewer methods have…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern "random", Poisson-Voronoi tessellations (PVT), or "non-random", Non Poisson-Voronoi…
We study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms. On the positive side, we show for strictly convex and smooth norms that the geometry of Voronoi cells of lattices in any dimension is similar…
Polygonal chains are fundamental objects in many applications like pattern recognition and protein structure alignment. A well-known measure to characterize the similarity of two polygonal chains is the famous Fr\`{e}chet distance. In this…
Consider the subset of a Weyl group with a fixed descent set. For Weyl groups of classical types, we determine the number of two-sided cells this subset intersect. Moreover, we apply this result to prove that certain rational Whittaker…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…
Given two sets of training samples, general method is to estimate the density function and classify the test sample according to higher values of estimated densities. Natural way to estimate the density should be histogram tending to…
The discrete polymatroid is a multiset analogue of the matroid. Based on the polyhedral theory on integral polymatroids developed in late 1960's and in early 1970's, in the present paper the combinatorics and algebra on discrete…
Cone spherical surfaces are orientable Riemannian surfaces with constant curvature one and a finite set of conical singularities. A subset of these surfaces, referred to as dihedral surfaces, is characterized by their monodromy groups,…
We show the existence of families of periodic polyhedra in spaces of constant curvature whose fundamental domains can be obtained by attaching prisms and antiprisms to Archimedean solids. These polyhedra have constant discrete curvature and…
The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes…
Power diagrams, a type of weighted Voronoi diagrams, have many applications throughout operations research. We study the problem of power diagram detection: determining whether a given finite partition of $\mathbb{R}^d$ takes the form of a…
We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).
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 construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
We have recently developed a mean-field theory to estimate the packing fraction of non-spherical particles [A. Baule et al., Nature Commun. (2013)]. The central quantity in this framework is the Voronoi excluded volume, which generalizes…
We introduce VoroFields, a hierarchical neural-field framework for approximating generalized Voronoi diagrams of finite geometric site sets in low-dimensional domains under arbitrary evaluable point-to-site distances. Instead of…
A hex sphere is a singular Euclidean sphere with four cone points whose cone angles are (integer) multiples of $\frac{2\pi}{3}$ but less than $2\pi$. We prove that the Moduli space of hex spheres of unit area is homeomorphic to the the…