Related papers: Neighborly inscribed polytopes and Delaunay triang…

We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…

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…

We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…

An arrangement of hyperplanes is strongly inscribable if it has an inscribed (or ideal hyperbolic) zonotope. We characterize inscribed zonotopes and prove that the family of strongly inscribable arrangements is closed under restriction and…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…

A Delaunay polytope $P$ is said to be {\em extreme} if the only (up to isometries) affine bijective transformations $f$ of $\R^n$, for which $f(P)$ is again a Delaunay polytope, are the homotheties. This notion was introduced in…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

In this paper, we determine the topology of the spaces of convex polyhedra inscribed in the unit $2$-sphere and the spaces of strictly Delaunay geodesic triangulations of the unit $2$-sphere. These spaces can be regarded as discretized…

Hyperbolic polynomials are real polynomials whose real hypersurfaces are nested ovaloids, the inner most of which is convex. These polynomials appear in many areas of mathematics, including optimization, combinatorics and differential…

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

We introduce a family of 3D combinatorial objects that we define as minimal 3D polyominoes inscribed in a rectanglar prism. These objects are connected sets of unitary cubic cells inscribed in a given rectangular prism and of minimal volume…

Classical Delaunay surfaces are highly symmetric constant mean curvature (CMC) submanifolds of space forms. We prove the existence of Delaunay-type hypersurfaces in a large class of compact manifolds, using the geometry of cohomogeneity one…

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…