The Graham scan triangulates simple polygons
- 30 November 1990
- journal article
- Published by Elsevier BV in Pattern Recognition Letters
- Vol. 11 (11), 713-716
- https://doi.org/10.1016/0167-8655(90)90089-k
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On geodesic properties of polygons relevant to linear time triangulationThe Visual Computer, 1989
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple PolygonSIAM Journal on Computing, 1988
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984
- Triangulation and shape-complexityACM Transactions on Graphics, 1984
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- Convex hull of a finite set of points in two dimensionsInformation Processing Letters, 1978
- Triangulating a simple polygonInformation Processing Letters, 1978
- Polygons Have EarsThe American Mathematical Monthly, 1975
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972