A fast convex hull algorithm
From MaRDI portal
Publication:1251805
DOI10.1016/0020-0190(78)90003-0zbMath0392.52003OpenAlexW1977401236MaRDI QIDQ1251805
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90003-0
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99)
Related Items (27)
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points ⋮ Mean area of the convex hull of a run and tumble particle in two dimensions ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) ⋮ Fast algorithms for computing the diameter of a finite planar set ⋮ Optimal parallel algorithms for computing convex hulls and for sorting ⋮ A note on linear expected time algorithms for finding convex hulls ⋮ How to reduce the average complexity of convex hull finding algorithms ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ An efficient and numerically correct algorithm for the 2D convex hull problem ⋮ The convex hull of the run-and-tumble particle in a plane ⋮ The two variable per inequality abstract domain ⋮ Computing the convex hull in a hammock ⋮ Method of orienting curves for determining the convex hull of a finite set of points in the plane ⋮ On polyhedra induced by point sets in space ⋮ Randomized quickhull ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Finite nondense point set analysis ⋮ On finding the convex hull of a simple polygon ⋮ EXACT AND OPTIMAL CONVEX HULLS IN 2D ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ A note on the all nearest-neighbor problem for convex polygons ⋮ An approximate algorithm for computing multidimensional convex hulls ⋮ A convex Hull algorithm for solving a location problem ⋮ From Parallelism to Nonuniversality: An Unconventional Trajectory ⋮ Some performance tests of convex hull algorithms ⋮ Quicker than Quickhull
Cites Work
- Unnamed Item
- A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
- A more efficient convex hull algorithm
- On the computational power of pushdown automata
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Convex hulls of finite sets of points in two and three dimensions
- Determining the Three-dimensional Convex Hull of a Polyhedron
This page was built for publication: A fast convex hull algorithm
