Some performance tests of convex hull algorithms

DOI10.1007/BF01934510zbMath0584.52002OpenAlexW1987048199MaRDI QIDQ1070524

D. C. S. Allison, M. T. Noga

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934510

zbMATH Keywords

computational geometrydistributive partitioninggeometric sortingplanar point distributionstwo-dimensional convex hull algorithms

Mathematics Subject Classification ID

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) Polytopes and polyhedra (52Bxx)

Related Items (4)

Convex-hull algorithms: implementation, testing, and experimentation ⋮ An efficient and numerically correct algorithm for the 2D convex hull problem ⋮ A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set ⋮ Sorting in linear expected time

Cites Work

• Unnamed Item
• The design and analysis of a new hybrid sorting algorithm
• Usort: An efficient hybrid of distributive partitioning sorting
• A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
• Convex hull of a finite set of points in two dimensions
• A fast convex hull algorithm
• Two remarks on a convex hull algorithm
• 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
• Constructing the convex hull of a set of points in the plane
• A Lower Bound to Finding Convex Hulls
• A New Convex Hull Algorithm for Planar Sets
• ZufÄllige konvexe Polygone in einem Ringgebiet
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I
• Measuring Concavity on a Rectangular Mosaic

This page was built for publication: Some performance tests of convex hull algorithms