The convex hull of a set of convex polygons

References

• Aho , A.V. , Hopcroft , J.E. and Ullman , J.D. 1974 . The design and analysis of computer algorithms , Reading, Mass : Addison-Wesley .
   Google Scholar
• Day , A.M. 1988 . Planar convex hull algorithms in theory and practice . Graphics Forum , 7 : 177 – 193 .
   Google Scholar
• Graham , R.L. 1972 . An efficient algorithm for determining the convex hull of a finite planar set . Info. Proc. Lett , 1 : 132 – 133 .
   Google Scholar
• Golin , M. and Sedgewick , R. . Analysis of a simple yet efficient convex hull algorithm . Proc. 4th Symposium on Computational Geometry . pp. 153 – 163 .
   Google Scholar
• Horowitz , E. and Sahni , S. 1977 . Fundamentals of data structures , Woodland Hills, Calif : Computer Science Press .
   Google Scholar
• Jarvis , R.A. 1973 . On the identification of the convex hull of a finite set of points in the plane . Info. Proc. Lett , 2 : 18 – 21 .
   Google Scholar
• Kiefer , J. 1953 . Sequential minimax search for a maximum . Proc. American Math. Soc , 4 : 502 – 506 .
   Web of Science ®Google Scholar
• Preparata , F.P. 1979 . An optimal real time algorithm for planar convex hulls . Comm. ACM , 22 : 402 – 405 .
   Google Scholar
• Preparata , F.P. and Hong , S.J. 1977 . Convex hull of finite sets of points in two and three dimensions . Comm. ACM , 20 : 87 – 93 .
   Web of Science ®Google Scholar
• Moret , B.M.E. and Shapiro , H.D. 1991 . “ Algorithms from P to NP ” . In Design and Efficiency , Vol. 1 , Redwood City, California : The Benjamin/Cummins Publishing Company .
   Google Scholar
• Preparata , F.P. and Shamos , M.I. 1985 . Computational geometry,an introduction , New York : Springer-Verlag .
   Google Scholar
• Renyi , A. and Shulanke , R. 1963 . Ueber die konvexe Hulle von n zufallig gewahlten Punkten . I Z Wahrschein , 2 : 75 – 84 .
   Google Scholar