Related papers: An Output Sensitive Algorithm for Discrete Convex …
A short proof of convergence for the discretization of the Hodge-Dirac operator in the framework of discrete exterior calculus (DEC) is provided using the techniques established in [Johnny Guzm\'an and Pratyush Potu, A Framework for…
The convex hull is a fundamental geometrical structure for many applications where groups of points must be enclosed or represented by a convex polygon. Although efficient sequential convex hull algorithms exist, and are constantly being…
We show that there exists a universal constant C>0 such that the convex hull of any N points in the hyperbolic space H^n is of volume smaller than C N, and that for any dimension n there exists a constant C_n > 0 such that for any subset A…
Let C be a real nonsingular affine curve of genus one, embedded in affine n-space, whose set of real points is compact. For any polynomial f which is nonnegative on C(R), we prove that there exist polynomials f_i with f \equiv \sum_i f_i^2…
We consider the following problem in computational geometry: given, in the d-dimensional real space, a set of points marked as positive and a set of points marked as negative, such that the convex hull of the positive set does not intersect…
The interior hull of a lattice polygon is the convex closure of the lattice points in the interior of the polygon. In this paper we give a concrete description of the interior hull of a clean lattice parallelogram. A clean parallelogram in…
We propose in this paper a discretization of the momentum convection operator for fluid flow simulations on quadrangular or hexahedral meshes. The space discretization is performed by the loworder nonconforming Rannacher-Turek finite…
The article 'A "regular" pentagonal tiling of the plane' by P. L. Bowers and K. Stephenson defines a conformal pentagonal tiling. This is a tiling of the plane with remarkable combinatorial and geometric properties. However, it doesn't have…
The integer hull of a polyhedron is the convex hull of the integer points contained in it. We show that the vertices of the integer hulls of a rational family of polyhedra of size O(n) have quasipolynomial coordinates. As a corollary, we…
We consider the time-convex hull problem in the presence of two orthogonal highways H. In this problem, the travelling speed on the highway is faster than off the highway, and the time-convex hull of a point set P is the closure of P with…
We propose an algorithm based on online convex optimization for controlling discrete-time linear dynamical systems. The algorithm is data-driven, i.e., does not require a model of the system, and is able to handle a priori unknown and…
The hull of a linear code (i.e., a finite field vector space)~\({\mathcal C}\) is defined to be the vector space formed by the intersection of~\({\mathcal C}\) with its dual~\({\mathcal C}^{\perp}.\) Constructing vector spaces with a…
To increase market transparency, independent system operators (ISOs) have been working on minimizing uplift payments based on convex hull pricing theorems. However, the large-scale complex systems for ISOs bring computational challenges to…
Let $D$ be an orientation of a simple graph. Given $u,v\in V(D)$, a directed shortest $(u,v)$-path is a $(u,v)$-geodesic. $S \subseteq V(D)$ is convex if, for every $u,v \in S$, the vertices in each $(u,v)$-geodesic and in each…
Let $K \in \R^d$ be a convex body, and assume that $L$ is a randomly rotated and shifted integer lattice. Let $K_L$ be the convex hull of the (random) points $K \cap L$. The mean width $W(K_L)$ of $K_L$ is investigated. The asymptotic order…
We present a comprehensive set of convergence tests which explore the role of various numerical parameters on the equilibrium structure of a simulated dark matter halo. We report results obtained with two independent, state-of-the-art,…
In this work, for a given oriented graph $D$, we study its interval and hull numbers, respectively, in the oriented geodetic, P3 and P3* convexities. This last one, we believe to be formally defined and first studied in this paper, although…
The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how…
For a given point set $S$ in a plane, we develop a distributed algorithm to compute the $\alpha-$shape of $S$. $\alpha-$shapes are well known geometric objects which generalize the idea of a convex hull, and provide a good definition for…
For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…