Related papers: Alpha-Concave Hull, a Generalization of Convex Hul…
The notion of convexity in tropical geometry is closely related to notions of convexity in the theory of affine buildings. We explore this relationship from a combinatorial and computational perspective. Our results include a convex hull…
We consider two algebras of curves associated to an oriented surface of finite type - the cluster algebra from combinatorial algebra, and the skein algebra from quantum topology. We focus on generalizations of cluster algebras and…
We consider the evolution of hypersurfaces in $\mathbb{R}^{n+1}$ with normal velocity given by a positive power of the mean curvature. The hypersurfaces under consideration are assumed to be strictly mean convex (positive mean curvature),…
We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…
Affine buildings are in a certain sense analogs of symmetric spaces. It is therefore natural to try to find analogs of results for symmetric spaces in the theory of buildings. In this paper we prove a version of Kostant's convexity theorem…
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…
Arcs and caps are fundamental structures in finite projective spaces. They can be generalised. Here, a survey is given of some important results on these objects, in particular on generalised ovals and generalised ovoids. The paper also…
The infinite models in integer programming can be described as the convex hull of some points or as the intersection of halfspaces derived from valid functions. In this paper we study the relationships between these two descriptions. Our…
In this paper, we present a simple yet effective padding scheme that can be used as a drop-in module for existing convolutional neural networks. We call it partial convolution based padding, with the intuition that the padded region can be…
This paper develops a unified framework for estimating the volume of a set in $\mathbb{R}^d$ based on observations of points uniformly distributed over the set. The framework applies to all classes of sets satisfying one simple axiom: a…
For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…
We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…
We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. Some results related to stable states/vectors, anti-stable states/vectors (over the…
We study the closure of the convex hull of a compact set in a complete CAT(0) space. First we give characterization results in terms of compact sets and the closure of their convex hulls for locally compact CAT(0) spaces that are either…
Convexification based on convex envelopes is ubiquitous in the non-linear optimization literature. Thanks to considerable efforts of the optimization community for decades, we are able to compute the convex envelopes of a considerable…
In this article, we extend Huisken's theorem that convex surfaces flow to round points by mean curvature flow. We construct certain classes of mean convex and non-mean convex hypersurfaces that shrink to round points and use these…
The problem of shadow is solved. It is equivalent to condition for point is in generalized convex hull of a family of compact sets.
We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…
This paper presents a new O(nlog(n)) algorithm for computing the convex hull of a set of 3 dimensional points. The algorithm first sorts the point in (x,y,z) then incrementally adds sorted points to the convex hull using the constraint that…