BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-81-887
       ENTRY:: June 05, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Finding the convex hull of a simple polygon
        TYPE:: Technical Report
      AUTHOR:: Graham, Ronald L.
      AUTHOR:: Yao, Frances
        DATE:: November 1981
       PAGES:: 10
    ABSTRACT:: It is well known that the convex hull of a set of n points in
               the (Euclidean) plane can be found by an algorithm having
               worst-case complexity O(n log n). In this note we give a
               short linear algorithm for finding the convex hull in the
               case that the (ordered) set of points from the vertices of a
               simple (i.e., non-self-intersecting) polygon.
       NOTES:: [Adminitrivia V1/Prg/19950605]
         END:: STAN//CS-TR-81-887