Convex Decomposition of Simple Polygons
- 1 October 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 3 (4) , 244-265
- https://doi.org/10.1145/357346.357348
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- A linear algorithm for finding the convex hull of a simple polygonInformation Processing Letters, 1979
- Another efficient algorithm for convex hulls in two dimensionsInformation Processing Letters, 1979
- An optimal real-time algorithm for planar convex hullsCommunications of the ACM, 1979
- Constructing the convex hull of a set of points in the planeThe Computer Journal, 1979
- A fast convex hull algorithmInformation Processing Letters, 1978
- A New Convex Hull Algorithm for Planar SetsACM Transactions on Mathematical Software, 1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- On the identification of the convex hull of a finite set of points in the planeInformation Processing Letters, 1973
- Measuring Concavity on a Rectangular MosaicIEEE Transactions on Computers, 1972