Related papers: Alpha-Concave Hull, a Generalization of Convex Hul…
Quickhull is an algorithm for computing the convex hull of points in a plane that performs well in practice, but has poor complexity on adversarial input. In this paper we show the same holds for the numerical stability of Quickhull.
We consider the nonconvex set $\mathcal S_n = \{(x,X,z): X = x x^T, \; x (1-z) =0,\; x \geq 0,\; z \in \{0,1\}^n\}$, which is closely related to the feasible region of several difficult nonconvex optimization problems such as the best…
We introduce an alternative way of constructing continuous flexible tubes and tubular structures based on a discrete, semi-discrete and smooth construction of surfaces known as T-hedra in the discrete case and profile-affine surfaces in the…
We calculate the cohomology spaces of the Hilbert schemes of points on surfaces with values in locally constant systems. For that purpose, we generalise I. Grojnoswki's and H. Nakajima's description of the ordinary cohomology in terms of a…
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 consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
Toric B\'ezier patches generalize the classical tensor-product triangular and rectangular B\'ezier surfaces, extensively used in $CAGD$. The construction of toric B\'ezier surfaces corresponding to multi-sided convex hulls for known…
The it Convex Hull Membership(CHM) problem is: Given a point $p$ and a subset $S$ of $n$ points in $\mathbb{R}^m$, is $p \in conv(S)$? CHM is not only a fundamental problem in Linear Programming, Computational Geometry, Machine Learning and…
We extend the construction of so-called encapsulated global summation-by-parts operators to the general case of a mesh which is not boundary conforming. Owing to this development, energy stable discretizations of nonlinear and variable…
In various approaches, data cubes are pre-computed in order to answer efficiently OLAP queries. The notion of data cube has been declined in various ways: iceberg cubes, range cubes or differential cubes. In this paper, we introduce the…
It is shown that a simple closed curve in $\mathbb C^n$ that is a uniform limit of rectifiable simple closed curves each of which has nontrivial polynomial hull has itself nontrivial polynomial hull. In case the limit curve is rectifiable,…
The simplicial depth, like other relevant multivariate statistical data depth functions, vanishes right outside the convex hull of the support of the distribution with respect to which the depth is computed. This is problematic when it is…
We consider the convex hull of the perturbed point process comprised of $n$ i.i.d. points, each distributed as the sum of a uniform point on the unit sphere $\S^{d-1}$ and a uniform point in the $d$-dimensional ball centered at the origin…
In this paper we study the following geometric problem: given $2^n-1$ real numbers $x_A$ indexed by the non-empty subsets $A\subset \{1,..,n\}$, is it possible to construct a body $T\subset \mathbb{R}^n$ such that $x_A=|T_A|$ where $|T_A|$…
The convex hull of a data set $P$ is the smallest convex set that contains $P$. In this work, we present a new data structure for convex hull, that allows for efficient dynamic updates. In a dynamic convex hull implementation, the following…
In this paper we deal with problems concerning the volume of the convex hull of two "connecting" bodies. After a historical background we collect some results, methods and open problems, respectively.
We study the convex hull property for systems of partial differential equations. This is a generalisation of the maximum principle for a single equation. We show that the convex hull property holds for a class of elliptic and parabolic…
We develop and analyze the HulC, an intuitive and general method for constructing confidence sets using the convex hull of estimates constructed from subsets of the data. Unlike classical methods which are based on estimating the (limiting)…
The aperture angle alpha(x, Q) of a point x not in Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the…
We describe a pure divide-and-conquer parallel algorithm for computing 3D convex hulls. We implement that algorithm on GPU hardware, and find a significant speedup over comparable CPU implementations.