Related papers: Intersection Bodies of Polytopes
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of…
We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of…
We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
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…
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 provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
In this paper we study how certain symmetries of convex bodies affect their geometric properties. In particular, we consider the impact of symmetries generated by the block diagonal subgroup of orthogonal transformations, generalizing…
In the paper "Isoperimetry of waists and local versus global asymptotic convex geometries", it was proved that the existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of randomly rotated…
The aim of this paper is to investigate the intersection problem between two linear sets in the projective line over a finite field. In particular, we analyze the intersection between two clubs with eventually different maximum fields of…