Related papers: Oriented Convex Containers of Polygons -- II
We develop a circle of ideas involving pairs of lines in the plane, intersections of hyperbolically rotated elliptical cones and the locus of the centers of rectangles inscribed in lines in the plane.
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…
In this paper we consider the isoperimetric profile of convex cylinders $K\times\mathbb{R}^q$, where $K$ is an $m$-dimensional convex body, and of cylindrically bounded convex sets, i.e, those with a relatively compact orthogonal projection…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…
Orbits of families of vector fields on a subcartesian space are shown to be smooth manifolds. This allows for a global description of a smooth geometric structure on a family of manifolds in terms of a single object defined on the…
Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…
We study the concept of cone metric space in the context of ordered vector spaces by setting up a general and natural framework for it.
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…
Polyhedral circle packings are generalizations of the Apollonian packing. We develop the theory of the Apollonian group, Descartes quadratic form, and related objects for all polyhedral packings. We use these tools to determine the domain…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
We initiate the study of convex geometry over ordered hyperfields. We define convex sets and halfspaces over ordered hyperfields, presenting structure theorems over hyperfields arising as quotients of fields. We prove hyperfield analogues…
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…
A polygon is derived that contains the numerical range of a bounded linear operator on a complex Hilbert space, using only norms. In its most general form, the polygon is an octagon, symmetric with respect to the origin, and tangent to the…
In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…
Rationally convex topological embeddings of compact surfaces (closed or with boundary) into $\mathbb{C}^2$ are constructed.
A convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…
In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…