Related papers: Representing convex geometries by almost-circles

Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…

Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex…

A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, continues to investigate representations of convex geometries…

Let F be a finite set of circles in the plane. We point out that the usual convex closure restricted to F yields a convex geometry, that is, a combinatorial structure introduced by P. H Edelman in 1980 under the name "anti-exchange closure…

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…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or finitary. This bears to the finite case proved by P.H.~Edelman…

A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…

Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

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 show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

A real projective orbifold has a radial end if a neighborhood of the end is foliated by projective geodesics that develop into geodesics ending at a common point. It has a totally geodesic end if the end can be completed to have the totally…

Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

We introduce the notion of a Tits arrangement on a convex open cone as a special case of (infinite) simplicial arrangements. Such an object carries a simplicial structure similar to the geometric representation of Coxeter groups. The…

A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made. The principal results are a sharp universal upper…

For locally convex vector spaces (l.c.v.s.) $E$ and $F$ and for linear and continuous operator $T: E \rightarrow F$ and for an absolutely convex neighborhood $V$ of zero in $F$, a bounded subset $B$ of $E$ is said to be $T$-V-dentable…