Constructing the convex hull of a set of points in the plane

DOI10.1093/comjnl/22.3.262zbMath0416.68060OpenAlexW1988190085MaRDI QIDQ3206332

Peter J. Green, Bernhard W. Silverman

Publication date: 1979

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/22.3.262

zbMATH Keywords

degenerate configurationscomputing the vertices of the convex hull of a set of points in the plane

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) Discrete mathematics in relation to computer science (68R99)

Related Items

Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation, Another efficient algorithm for convex hulls in two dimensions, Bounds and algorithms for geodetic hulls, Principal components of sample estimates: an approach through symbolic data analysis, Maintenance of configurations in the plane, Convex-hull algorithms: implementation, testing, and experimentation, An efficient and numerically correct algorithm for the 2D convex hull problem, The Gifi system of descriptive multivariate analysis., Randomized quickhull, Some performance tests of convex hull algorithms