Finding the convex hull of a simple polygon

DOI10.1016/0196-6774(83)90013-5zbMath0532.68072WikidataQ106189157 ScholiaQ106189157MaRDI QIDQ5896232

F. Frances Yao, Ronald L. Graham

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90013-5

zbMATH Keywords

computer graphics; convex hull; linear-time algorithm; simple polygon

Mathematics Subject Classification ID

52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry

51M20: Polyhedra and polytopes; regular figures, division of spaces

52A10: Convex sets in (2) dimensions (including convex curves)

68R99: Discrete mathematics in relation to computer science

Related Items

tigers, Computing external farthest neighbors for a simple polygon, Optimal time bounds for some proximity problems in the plane, Constructing the convex hull of a partially sorted set of points