The following text file contains a set, , of one thousand 2d Cartesian points.
Your task is to compute the convex hulls of . Let be the set of vertices of the convex hulls of the point . How many elements does contain?
Suppose we are given three coordinate points , and . Your task is to devise a routine that tests whether point lies to the right of the directed line which goes from point to point . If so, the angle formed by sweeping from to in a counterclokwise manner around is acute.
Each line of the following text file contains the three points arranged like the following:
[x0,y0,x1,y1,x2,y2]
How many of the triples satisfy the test described above?