Convex Hull Problems
Raimi Rufai2015
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
AI
AI
The paper discusses the significant developments in the convex hull problem, a central topic in computational geometry. It reviews historical algorithms, particularly highlighting Graham's algorithm and its optimality proofs in various dimensions. Open problems related to lower bounds in even dimensions, the complexities of Delaunay triangulations, and the realization of convex hull vertices are explored, pointing out the ongoing challenges and conjectures in the field.
Figures (1)
Related papers
Space-efficient planar convex hull algorithms
Theoretical Computer Science, 2004
A space-efficient algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. We describe four space-efficient algorithms for computing the convex hull of a planar point set.
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
Journal of Algorithms, 1997
In this paper we present a truly practical and provably optimal O(n logh) time outputsensitive algorithm for the planar convex hull problem. The basic algorithm is similar to the algorithm presented in Chan, Snoeyink and Yap 2] where the median-nding step is replaced by an approximate median. We analyze two such schemes and show that for both methods, the algorithm runs in expected O(n log h) time. The expected number of comparisons can be made smaller than 5n logh for the upper-hull. We further show that the probability of deviation from expected running time approaches 0 rapidly with increasing values of n and h for any input. Our experiments suggest that this algorithm is a practical alternative to the worstcase O(n log n) algorithms like Graham's and especially faster for small output-sizes. Our approach bears some resemblance to a recent algorithm of Wenger 13] but our analysis is substantially di erent. The planar convex hull problem is perhaps the most studied problem in computational geometry and a large body of literature deals with computing convex hulls. Graham 5] was the rst to present an O(n log n) worst-case time algorithm. This algorithm is optimal as Yao 14] showed that (n log n) is the lower bound of the convex hull problem for the worst-case input. Some simple algorithms have O(n) expected time for known distributions of points such as uniform in a box, normal, etc. The rst output-sensitive algorithm was proposed by Chand and Kapur 3]. The two-dimensional version of their algorithm is known as the rope fence method and was independently reported by Jarvis 6]. The rope fence method takes O(nh) time to compute h extreme edges of the convex hull. Kirkpatrick and Seidel 8] proved an (n logh) lower bound when both input and output sizes are considered, so Yao's lower-bound is a special case when log h 2 (log n). They also proposed an O(n log h) optimal algorithm based on the prune-and-search technique developed by Dyer 4] and Megiddo 9]. However, it has high constants and is considered prohibitively complicated for implementation. Very recently, in 1], two O(n log h) algorithms have been proposed. One uses the linear-time median nding algorithm and the other uses a clever grouping technique. Although the latter algorithm does not have any expensive median-nding step it relies on a sophisticated logarithmic time tangent-nding routine.
Time-space optimal convex Hull algorithms
Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing states of the art and practice - SAC '93, 1993
In-Place Planar Convex Hull Algorithms
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . .
Efficient parallel convex hull algorithms
IEEE Transactions on Computers, 1988
A bstract-In this paper, we present parallel algorithms to identifv (i.e., detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, EREW PRAM, and a modified AKS network. It is known that the problem of identifying the convex hull for a set of planar points given arbitrarily cannot be solved faster than sorting. For the situation where the input set of n planar points is given ordered (by x-coordinate) one per processor on a machine with 8 (n) processors, we introduce a worst case hypercube algorithm that finishes in 80og n) time, a worst case algorithm for the pyramid, tree, and mesh-of-trees that finishes in 8(log3 n/(log log n)*) time, and a worst case algorithm for the mesh with a reconfigurable bus that finishes in 8(log2 n) time. Notice that for ordered data the sorting bound does not apply. We also show that our 80og n) time hypercube algorithm for ordered data extends to yield an optimal time and processor 80og n) worst case time EREW PRAM algorithm for the case where the set of planar points is distributed arbitrarily one point per processor. We also show that this algorithm can be extended to run in worst case 80og n) time on a modified AKS network, giving the first optimal 80og n) time algorithm for solving the convex hull problem for arbitrary planar input on a fixed degree network.
Adaptive (analysis of) algorithms for convex hulls and related problems
See http://www. cs. uwaterloo. ca/~ jbarbay/Recherche/ …, 2008
Adaptive analysis is a well known technique in computational geometry, which renes the traditional worst case analysis over all instances of xed input size by taking into account some other parameters, such as the size of the output in the case of output sensitive analysis. We present two adaptive techniques for the computation of the convex hull in two and three dimensions and related problems. The rst analysis technique is based on the input order and yields results on the computation of convex hulls in two and three dimensions, and the rst adaptive algorithm for Voronoi and Delaunay diagrams, through the entropy of a partition of the input in easier instances. The second analysis technique is based on the structural entropy of the instance, and yields results on the computational complexity of planar convex hull and of multiset sorting, through a generalization of output sensitivity and a more precise analysis of the complexity of Kirkpatrick and Seidel's algorithm. Our approach yields adaptive algorithms which perform faster on many classes of instances, while performing asymptotically no worse in the worst case over all instances of xed size.
On the definition and computation of rectilinear convex hulls
Information Sciences, 1984
Recently the computation of the rectilinear convex hull of a collection of rectilinear polygons has been studied by a number of authors. From these studies three distinct definitions of rectilinear convex hulls have emerged. We examine these three definitions for point sets in general, pointing out some of their consequences, and we give optimal algorithms to compute the corresponding rectilinear convex hulls of a finite set of points in the plane.
Extended convex hull
Computational Geometry, 2001
In this paper we address the problem of computing a minimal representation of the convex hull of the union of k H-polytopes in R d. Our method applies the reverse search algorithm to a shelling ordering of the facets of the convex hull. Efficient wrapping is done by projecting the polytopes onto the two-dimensional space and solving a linear program. The resulting algorithm is polynomial in the sizes of input and output under the general position assumption.
A 2-D parallel convex hull algorithm with optimal communication phases
Parallel Computing, 2001
We investigate the problem of ®nding the 2-D convex hull of a set of points on a coarsegrained parallel computer. Goodrich has devised a parallel sorting algorithm for n items on P processors which achieves an optimal number of communication phases for all ranges of P T n. Ferreira et al. have recently introduced a deterministic convex hull algorithm with a constant number of communication phases for n and P satisfying n P P 1 . Here we present a new parallel 2-D convex hull algorithm with an optimal bound on number of communication phases for all values of P T n while maintaining optimal local computation time. Ó .hk (X. Deng). 0167-8191/01/$ -see front matter Ó 2001 Elsevier Science B.V. All rights reserved. PII: S 0 1 6 7 -8 1 9 1 ( 0 0 ) 0 0 0 9 7 -1
Related topics
Related papers
Computing Prescriptions: Quickhull: Computing Convex Hulls Quickly
Computing in Science & Engineering, 2009
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in ℝn$\mathbb {R}^{n}$
Numerical Algorithms, 2020
In this paper, we present an efficient improvement of gift wrapping algorithm for determining the convex hull of a finite set of points in R n space, applying the best restricted area technique inspired from the Method of Orienting Curves (this method was used successfully in computational geometry by An and Trang in Numerical Algorithms 59, 347-357 (2012), Optimization 62, 975-988 (2013)). The numerical experiments on the sets of random points in two-and three-dimensional space show that the running time of our algorithm is faster than the gift wrapping algorithm and the newest modified one. Keywords Convex hull • Convex polytope • Gift wrapping algorithm • Orienting curves Mathematics Subject Classification (2010) 51-52 Phan Thanh An and Nam Dũng Hoang equally contributed to this work.
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Proceedings of the 27th annual ACM symposium on Computational geometry - SoCG '11, 2011
Given a set Σ of spheres in E d , with d ≥ 3 and d odd, having a fixed number of m distinct radii ρ 1 , ρ 2 , . . . , ρ m , we show that the worst-case combinatorial complexity of the convex hull
A Preprocessing Technique for Fast Convex Hull Computation
Procedia Computer Science
Computing the convex hull of a set of points is a fundamental issue in many fields, including geometric computing, computer graphics, and computer vision. This problem is computationally challenging, especially when the number of points is past the millions. In this paper, we propose a fast filtering technique that reduces the computational cost for computing a convex hull for a large set of points. The proposed method preprocesses the input set and filters all points inside a four-vertex polygon. The experimental results showed the proposed filtering approach achieved a speedup of up to 77 and 12 times faster than the standard Graham scan and Jarvis march algorithms, respectively.
Parallel Algorithms for Higher-Dimensional Convex Hulls
IEEE Symposium on Foundations of Computer Science, 1994
We give fast randomized and deterministic parallel methodsfor constructing convex hulls in IRd, for any fixed d.Our methods are for the weakest shared-memory model,the EREW PRAM, and have optimal work bounds (withhigh probability for the randomized methods). In particular,we show that the convex hull of n points in IRdcanbe constructed in O(logn) time using O(n log n + nbd=2c)work, with
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
Discrete & Computational Geometry, 1997
This paper presents an algorithm and its probabilistic analysis for constructing the convex hull ofm given points in Rn, the n-dimensional Euclidean space. The algorithm under consideration combines the Gift-Wrapping concept with the so-called Throw-Away Principle (introduced by Aki and Toussaint [1 ] and later by Devroye [10]) for nonextremal points. The latter principle had been used for a convex-hull-construction algorithm in R 2 and for its probabilistic analysis in a recent paper by Borgwardt et al. . There, the considerations remained much simpler, because in R2 the construction of the convex hull essentially requires recognition of the extremal points and of their order only.
A Sublogarithmic Convex Hull Algorithm
Bit Numerical Mathematics, 1990
We present a parallel algorithm for finding the convex hull of a sorted set of points in the plane. Our algorithm runs inO(logn/log logn) time usingO(n log logn/logn) processors in theCommon crcw pram computational model, which is shown to be time and cost optimal. The algorithm is based onn 1/3 divide-and-conquer and uses a simple pointer-based data structure.
new lower bounds for convex hull problems in odd dimensions
We s h o w t h a t i n t h e w orst case, (n dd=2e;1 + n log n) sidedness queries are required to determine whether the convex hull of n points in IR d is simplicial, or to determine the numberof convex hull facets. This lower bound matches known upper bounds in any odd dimension. Our result follows from a straightforward adversary argument. A key step in the proof is the construction of a quasi-simplicial n-vertex polytope with (n dd=2e;1 ) degenerate facets. While it has been known for several years that d-dimensional convex hulls can have ( n bd=2c ) facets, the previously best lower bound for these problems is only (n log n). Using similar techniques, we also obtain simple and correct proofs of Erickson and Seidel's lower bounds for detecting a ne degeneracies in arbitrary dimensions and circular degeneracies in the plane. As a related result, we show that detecting simplicial convex hulls in IR d is dd=2esum-hard, in the sense of Gajentaan and Overmars.
A linear time algorithm for obtaining the convex hull of a simple polygon
Pattern Recognition, 1983
In this paper, a linear time algorithm is described for finding the convex hull of a simple (i.e. nonself intersecting) polygon. Convex hull algorithm Computational complexity Simple polygon Convex polygon Ordered crossing polygon
A modification of Graham's algorithm for determining the convex hull of a finite planar set
Annales Mathematicae et Informaticae, 2007
In this paper, in our modification of Graham scan for determining the convex hull of a finite planar set, we show a restricted area of the examination of points and its advantage. The actual run times of our scan and Graham scan on the set of random points shows that ...
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.