Semantic Scholar uses AI to extract papers important to this topic.
In this paper we characterize the convex hull of feasible points for a disjunctive program, a class of problems which subsumes… Expand The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convex… Expand Many algorithms for both identifying and reconstructing a 3-D object are based on the 2-D silhouettes of the object. In general… Expand We present a deterministic algorithm for computing the convex hull ofn points inEd in optimalO(n logn+n⌞d/2⌟) time. Optimal… Expand In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a… Expand In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a… Expand We present a new planar convex hull algorithm with worst case time complexity $O(n \log H)$ where $n$ is the size of the input… Expand We describe a new algorithm for finding the convex hull of any simple polygon specified by a sequence of m vertices. An earlier… Expand The convex hulls of sets of n points in two and three dimensions can be determined with O(n log n) operations. The presented… Expand Step Find a point Pin the plane w%ch is in &he In&$x of Cl-l(s). At worst, this can be done in clfl sQp9 by te dting 3 element… Expand