Related papers: Alpha-Concave Hull, a Generalization of Convex Hul…

Seeking the convex hull of an object is a very fundamental problem arising from various tasks. In this work, we propose two variational convex hull models using level set representation for 2-dimensional data. The first one is an exact…

An effort has been made to show mathematicians some new ideas applied to image analysis. Gray images are presented as tilings. Based on topological properties of the tiling, a number of gray convex hulls: maximal, minimal, and oriented ones…

In this paper we extend some notions, previously defined for log-concave functions, to the larger domain of so-called {\alpha}-concave functions. We begin with a detailed discussion of support functions - first for log-concave functions,…

Mixed volumes, which are the polarization of volume with respect to the Minkowski addition, are fundamental objects in convexity. In this note we announce the construction of mixed integrals, which are functional analogs of mixed volumes.…

Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for…

We present a convex hull algorithm that is accelerated on commodity graphics hardware. We analyze and identify the hurdles of writing a recursive divide and conquer algorithm on the GPU and divise a framework for representing this class of…

We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…

This is a survey on tropical polytopes from the combinatorial point of view and with a focus on algorithms. Tropical convexity is interesting because it relates a number of combinatorial concepts including ordinary convexity, monomial…

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

The convex hull property is the natural generalization of maximum principles from scalar to vector valued functions. Maximum principles for finite element approximations are often crucial for the preservation of qualitative properties of…

In this paper we study the problem of calculating the convex hull of certain affine algebraic varieties. As we explain, the motivation for considering this problem is that certain pure-state measures of quantum entanglement, which we call…

K\"unzi and Yildiz introduced convexity structures in the sense of Takahashi for $T_{0}$-quasi-metric spaces. In this article, we continue this line of study on the Isbell-convex hull of an asymmetrically normed real vector space. Using the…

This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $\Gamma$-convexity. Here $\Gamma$ is a tuple of free symmetric polynomials determining the geometry of a…

We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the…

Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them. In particular, we…

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

We give an explicit construction of the cusp eigenforms on an elliptic curve defined over a finite field using the theory of Hall algebras and the Langlands correspondence for function fields and $\GL_n$. As a consequence we obtain a…

We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon…

This paper deals with the regularization of the sum of functions defined on a locally convex spaces through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum…

In this paper, two parallel notions of convexity of sets are introduced in the abelian semigroup setting. The connection of these notions to algebraic and to set-theoretic operations is investigated. A formula for the computation of the…