Related papers: Hunting for reduced polytopes
For some self-similar sets K in d-dimensional Euclidean space we obtain certain lower bounds for the lower Minkowski dimension of K+E in terms of the lower Minkowski dimension of E.
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number…
A subset of a convex body $B$ containing the origin in a Euclidean space is {\it parkable in $B$} if it can be translated inside $B$ in such a manner that the translate the origin. We provide characterizations of ellipsoids and of centrally…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
The mixed area of a Reuleaux polygon and its symmetric with respect to the origin is expressed in terms of the mixed area of two explicit polygons. This gives a geometric explanation of a classical proof due to Chakerian. Mixed areas and…
In this paper we analyze the extension of the classical smallest enclosing disk problem to the case of the location of a polyellipsoid to fully cover a set of demand points in $\mathbb{R}^d$. We prove that the problem is polynomially…
We define an analogue of the cube and an analogue of the 5-wedge in higher dimensions, each with $2d+2$ vertices and $d^2+2d-3$ edges. We show that these two are the only minimisers of the number of edges, amongst d-polytopes with $2d+2$…
Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…
We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…
We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions.…
We confirm two conjectures of Lassak on the area of reduced spherical polygons. The area of every reduced spherical non-regular $n$-gon is less than that of the regular spherical $n$-gon of the same thickness. Moreover, the area of every…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that visits at least one point in each region. Even in the…
The global existence of weak solutions to the three space dimensional Prandtl equations is studied under some constraint on its structure. This is a continuation of our recent study on the local existence of classical solutions with the…
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…