Related papers: Complexity and algorithms for computing Voronoi ce…
We show that the Voronoi cells of the lattice of integer flows of a finite connected graph $G$ in the quadratic vector space of real valued flows have the following very precise combinatorics: the face poset of a Voronoi cell is isomorphic…
This manuscript explores novel complexity results for the feasibility problem over $p$-order cones, extending the foundational work of Porkolab and Khachiyan. By leveraging the intrinsic structure of $p$-order cones, we derive refined…
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in any number of dimensions. These conditions are natural for…
We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…
Consider a face-to-face parallelohedral tiling of $\mathbb R^d$ and a $(d-k)$-dimensional face $F$ of the tiling. We prove that the valence of $F$ (i.e. the number of tiles containing $F$ as a face) is not greater than $2^k$. If the tiling…
We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…
Selecting a connected subnetwork enriched in individually important vertices is an approach commonly used in many areas of bioinformatics, including analysis of gene expression data, mutations, metabolomic profiles and others. It can be…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…
We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested…
The Voronoi tessellation of a homogeneous Poisson point process in the lower half-plane gives rise to a family of vertical elongated cells in the upper half-plane. The set of edges of these cells is ruled by a Markovian branching mechanism…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
The intersections between a spherical shell and the faces of Voronoi's polyhedrons are numerically evaluated. The nodes of these intersections are the points that share the same distances from three nuclei. The nodes are assumed to be the…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
A rational triangle has rational edge-lengths and area; a rational tetrahedron has rational faces and volume; either is Heronian when its edge-lengths are integer, and proper when its content is nonzero. A variant proof is given, via…
Classical objects in computational geometry are defined by explicit relations. Several years ago the pioneering works of T. Asano, J. Matousek and T. Tokuyama introduced "implicit computational geometry", in which the geometric objects are…
Main purpose of this work is to introduce a general technique of projection of the Voronoi tessellation of the weight lattice $A_n^\ast$ and apply it for the lattice $A_4^\ast$. The projection of the Voronoi tessellation of the weight…
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equally-sized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive…
A straightforward algorithm for the symbolic computation of higher-order symmetries of nonlinear evolution equations and lattice equations is presented. The scaling properties of the evolution or lattice equations are used to determine the…
We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov etal [ABT08] prove that, if one makes certain realistic input assumptions on the terrain, this complexity…