INPUT FORMAT for the first assignment:

The input file should be given as a command line argument. 
1. First line of the file : Number of vertices 
2. Rest of the lines of the file: x y coordinates of the
   vertices of the polygon, in counter-clockwise order; 
   one vertex coordinates per line.
    ( the x and y could have spaces in between, or a comma,
       incase you have already started that way)

  NON_SIMPLE POLYGON TESTING:

It is expected that you check if the polygon is 'simple' also
(i.e) it doesnot have the  edges intersecting with each other.

This has to be done along with monotonicity checking and it
should be done in linear time. Please follow the algortihms
Prof. Gunopulos has given in the class for cheking of simplicity of
polygons as well as for triangulation. 

Incase of any doubts/clarifications, please mail or meet the TA
Sharmila during office hours, or by fixing up a time thru' 
email - sharmi@cs.ucr.edu