On the Inequalities of Projected Volumes and the Constructible Region
Zihan Tan, Liwei Zeng

TL;DR
This paper investigates the geometric problem of characterizing the set of all possible volume projections of subsets in Euclidean space, introducing new inequalities, and demonstrating that this set is non-convex and complex.
Contribution
It introduces nonuniform-cover inequalities as a generalization of known inequalities, and proves that the constructible region is non-convex and cannot be fully characterized by linear inequalities.
Findings
Constructible region is contained within a polyhedral cone.
Constructible region is not convex.
Some subclasses of the proposed inequalities are invalid.
Abstract
We study the following geometry problem: given a dimensional vector , is there an object such that , for all , where is the projection of to the subspace spanned by the axes in ? If does correspond to an object in , we say that is {\em constructible}. We use to denote the constructible region, i.e., the set of all constructible vectors in . In 1995, Bollob\'{a}s and Thomason showed that is contained in a polyhedral cone, defined a class of so called uniform cover inequalities. We propose a new set of natural inequalities, called nonuniform-cover inequalities, which generalize the BT inequalities. We show that any linear inequality that all points in satisfy must be a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Digital Image Processing Techniques
