Related papers: Oriented Convex Containers of Polygons -- II
We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained…
In a compact orbifold, for small prescribed volume, an isoperimetric region is close to a small metric ball; in a Euclidean orbifold, it is a small metric ball.
We present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…
Convex sets appear in various mathematical theories, and are used to define notions such as convex functions and hulls. As an abstraction from the usual definition of convex sets in vector spaces, we formalize in Coq an intrinsic…
Ordered locally convex spaces is an important classes of spaces in the theory of ordered topological vector spaces just as locally convex spaces in the theory of topological vector spaces. Some special classes of ordered locally convex…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
A combinatorial object representing schemas of, possibly skew, perspectives, called {\em a configuration of skew perspective} is defined. Some classifications of skew perspectives are presented.
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
We introduce a concept that generalizes several different notions of a "centerpoint" in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based…
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.
The tensor product of two ordered vector spaces can be ordered in more than one way, just as the tensor product of normed spaces can be normed in multiple ways. Two natural orderings have received considerable attention in the past, namely…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
Starting from the classical notion of an oriented congruence (i.e. a foliation by oriented curves) in $R^3$, we abstract the notion of an oriented congruence structure. This is a 3-dimensional CR manifold $(M,H, J)$ with a preferred…
For a given polyhedral convex set-valued mapping we define a polyhedral convex cone which we call the natural ordering cone. We show that the solution behavior of a polyhedral convex set optimization problem can be characterized by this…
We provide direct inductive constructions of the orientals and the cubes, exhibiting them as the iterated cones, respectively, the iterated cylinders, of the terminal strict globular omega-category.
An oriented link projection is the image of a generic immersion of oriented circles into the 2-sphere. The circle arrangement of a link projection is a disjoint union of unoriented circles on the 2-sphere obtained by orientation-incoherent…
We introduce the notion of order projections using the order unit property of a positive element in an order unit space and characterize them in terms of (geometric) orthogonality. We describe order projections of the order unit space…
In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the…
The geometries of spaces having as groups the real orthogonal groups and some of their contractions are described from a common point of view. Their central extensions and Casimirs are explicitly given. An approach to the trigonometry of…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…