Related papers: A natural extension to the convex hull problem and…
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…
We extend Freiman's inequality on the cardinality of the sumset of a $d$ dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.
A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…
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…
Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
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…
The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…
Prune-and-search is an important paradigm for solving many important geometric problems. We show that the general prune-and-search technique can be implemented where the objects are given in read-only memory. As examples we consider…
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…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
We envision programmable matter as a system of nano-scale agents (called particles) with very limited computational capabilities that move and compute collectively to achieve a desired goal. We use the geometric amoebot model as our…
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…
Region extraction is necessary in a wide range of applications, from object detection in autonomous driving to analysis of subcellular morphology in cell biology. There exist two main approaches: convex hull extraction, for which exact and…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…