An efficient algorithm for determining the convex hull of a finite planar set
From MaRDI portal
Publication:2552382
DOI10.1016/0020-0190(72)90045-2zbMath0236.68013WikidataQ56017901 ScholiaQ56017901MaRDI QIDQ2552382
Publication date: 1972
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(72)90045-2
68W99: Algorithms in computer science
Related Items
On random cartesian trees, Convex hull of a planar set of straight and circular line segments, Randomized quickhull, Fast randomized parallel methods for planar convex hull construction, Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays, Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays, Small-dimensional linear programming and convex hulls made easy, Computing the convex hull in a hammock, The role of Steiner hulls in the solution to Steiner tree problems, Applications of a semi-dynamic convex hull algorithm, Hamiltonian triangulations and circumscribing polygons of disjoint line segments, Constructing strongly convex hulls using exact or rounded arithmetic, Fast linear expected-time algorithms for computing maxima and convex hulls, An approximate algorithm for computing multidimensional convex hulls, Numerical stability of a convex hull algorithm for simple polygons, An optimal convex hull algorithm in any fixed dimension, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, A workbench for computational geometry, Computing minimum length paths of a given homotopy class, Robust gift wrapping for the three-dimensional convex hull, Derandomizing an output-sensitive convex hull algorithm in three dimensions, Optimal, output-sensitive algorithms for constructing planar hulls in parallel, The biobjective absolute center problem, On shortest three-edge-connected Steiner networks with Euclidean distance, Constructing the convex hull of a partially sorted set of points, Optimal output-sensitive convex hull algorithms in two and three dimensions, Output-sensitive results on convex hulls, extreme points, and related problems, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), A time-optimal parallel algorithm for three-dimensional convex hulls, An algorithm for the construction of convex hulls in simple integer recourse programming, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points, The convex hull of a set of convex polygons
