Related papers: Convex Hulls, Oracles, and Homology
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…
It is shown that there exist arcs and simple closed curves in ${\mathbb C}^3$ with nontrivial polynomial hulls that contain no analytic discs. It is also shown that in any bounded Runge domain of holomorphy in ${\mathbb C}^N$ ($N \geq 2$)…
Tomography is the area of reconstructing objects from projections. Here we wish to reconstruct a set of cells in a two dimensional grid, given the number of cells in every row and column. The set is required to be an hv-convex polyomino,…
Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…
In this paper we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing $\textit{bottlenecks}$ of the variety. Using geometric information such as the…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
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…
It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are 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,…
Convex optimization encompasses a wide range of optimization problems that contain many efficiently solvable subclasses. Interior point methods are currently the state-of-the-art approach for solving such problems, particularly effective…
In the article "Construction of the continuous hull for the combinatorics of a regular pentagonal tiling of the plane" we constructed the continuous hull for the combinatorics of "A regular pentagonal tiling of the plane", and in the…
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
We present a recursive formulation of the Horn algorithm for deciding the satisfiability of propositional clauses. The usual presentations in imperative pseudo-code are informal and not suitable for simple proofs of its main properties. By…
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…
This paper evaluates several improvements to the memory layout of convex hulls to improve computation times for support point queries. The support point query is a fundamental part of common collision algorithms, and the work presented…
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
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…
Recently increasing penetration of renewable energy generation brings challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable generation and discrete…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We revisit the method of characteristics for shock wave solutions to nonlinear hyperbolic problems and we describe a novel numerical algorithm - the convex hull algorithm (CHA) - in order to compute, both, entropy dissipative solutions…