Problem I. 133. (May 2006)
I. 133. Write a program to classify closed planar polygons. A polygon is given with its vertices; first the number of vertices is given, then two coordinates of each vertex in each line are specified. Your program should decide whether the polygon has positive or negative orientation, or it is selfintersecting. (This latter case should also include polygons with some coinciding vertices or when a vertex lies on the interior of another side.)
Examples:
The source code (i133.pas, i133.cpp, ) is to be submitted.
(10 pont)
Deadline expired on 15 June 2006.
Sorry, the solution is available only in Hungarian. Google translation
i133.rar
i133tesztadatok.rar
i133mintamegoldas.doc
Statistics:
