References

1) Sklansky J., "Measuring Concavity on a Rectangular Mosaic", IEEE Transactions on Computing, 21, p1355, 1972.

2) Shamos M.I., "Problems in Computational Geometry", Computational Geometry, Carnegie Mellon University, 1975.

3) McCallum D., Avis D., "A linear Algorithm for Finding the Convex Hull of a Simple Polygon", Information Processing Letters, v.9 #5, p.201, 1979.

4) Kim C.E., "Linear Time Convex Hull Algorithms for Simple Polygons", Technical Report #956, Dept. of Computer Science, University of Maryland, 1980.

5) Sklansky J., "Finding the Convex Hull of a Simple Polygon", Pattern Recognition Letters, v.1 #2, p.79, Dec.1982.

6) Toussaint G.T., Avis D., "On convex hull algorithm for polygons and its application to triangulation problems", Pattern Recognition, vol.15, #1, p.23, 1982.

7) Toussaint G.T., ElGindy H., "A Counterexample to an Algorithm for Computing Monotone Hulls of Simple Polygons", Pattern Recognition Letters, v.1 #4, p.219, 1983.

8) Lee D.T., "On Finding the Convex Hull of a Simple Polygon", International Journal of Computers and Information Sciences, v.12 #2, p.87, 1983.

9) Graham R.L., Yao F.F., "Finding the Convex Hull of a Simple Polygon", Journal of Algorithms 4, p.324, 1983.

10) ElGindy H., Avis D., Toussaint G., "Applications of a Two-Dimensional Hidden-Line Algorithm to Other Geometric Problems", Computing, vol.31, p191, 1983.

11) ElGindy H., Avis D., "A Linear Algorithm for Computing the Visibility Polygon from a Point", Journal of Algorithms, v.2, p186, 1981.

12) Ghosh S.K., Shyamasundar R.K., "A linear time algorithm for computing the Convex Hull of a Simple Polygon", Pattern Recognition, v.16 #6, p.587, 1983.

13) Bhattacharya B.K., ElGindy H., "A New Linear Convex Hull Algorithm for Simple Polygons", IEEE Transactions on Information Theory, vol. IT-30, #1, Jan.1984.

14) Preparata F.P., Shamos M.I., Computational Geometry, ch.4, Springer-Verlag, New York, 1985.

15) Orlowski M., "A Convex Hull Algorithm for Planar Simple Polygons", Pattern Recognition, v.18 #5, p.361, 1985.

16) Shin S.Y., Woo T.C., "Finding the Convex Hull of a Simple Polygon in Linear Time", Pattern Recognition, v.19 #6, p.453, 1986.

17) Werner G., "The Computation of the Convex Hull of a Simple Polygon in Linear Time", Computers and Artificial Intelligence, v.5 #5, p.45, 1986.

18) ElGindy H., "Comments on: The Computation of the Convex Hull of a Simple Polygon in Linear Time", Computers and Artificial Intelligence, v.6 #5, p.437, 1987.

19) Melkman A., "On-line Construction of the Convex Hull of a Simple Polygon", Information Processing Letters 25, p.11, 1987.

20) Chen C., "Computing the Convex Hull of a Simple Polygon", Pattern Recognition, v.22 #5, p.561, 1989.

21) Toussaint G.T., "A Counterexample to a Convex Hull Algorithm for Polygons", Pattern Recognition, v.24 #2, p.183, 1991.

22) Tor S.B., Middleditch A.E., "Convex Decomposition of Simple Polygons", ACM Trans. Graphics, v.3, p.244, 1984.

For Montrealers...

Almost all references are available at the PSE library of McGill. The volumes of Pattern Recognition Letters and [3] are available at Concordia. Computing and Journal of Algorithms v.4 are at U.Montreal. Ref.[2] and [4] must be requested via inter-library loans.