References
Akl, Selim G. and Godfried Toussaint, "A Fast Convex Hull Algorithm," Information Processing Letters, 7(5), 1978.
Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Cliffort Stein, Introduction to Algorithms, Second Edition. McGraw Hill, 2001.
Graham, R. L., "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set," Information Processing Letters 1: 132-133, 1972.
Melkman, A., "On-line construction of the convex hull of a simple polygon," Information Processing Letters 25: 11-12, 1987.
Overmars, Mark and Jan van Leeuwen, "Maintenance of Configurations in the Plane," Journal of Computer and System Sciences, 23(2): 166-204, 1981.
Palazzi, Larry and Jack Snoeyink, "Counting and Reporting Red/Blue Segment Intersections," CVGIP: Graphical Models and Image Processing, 56(4): 304-310, 1994.
Preparata, Franco and Michael Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
Get Algorithms in a Nutshell now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
