The document provides exercises for determining properties of polygons. The first exercise is to design an algorithm to detect reflex vertices in an arbitrary polygon where an interior angle is greater than π radians. The second exercise is to design an algorithm to find the largest interior angle of a convex polygon and extend it to work for any polygon. The third exercise is to find the horizontal line that bisects the area of a given convex polygon.

1. Exercises for Convexity of Polygons
Author: Kasun Ranga Wijeweera
Email: krw19870829@gmail.com
Date: 20150421
1) If an interior angle of a vertex of a polygon is greater than π radians. Then it is called a reflex
vertex. Design and implement an algorithm to detect reflex vertices of an arbitrary polygon.
2) Design and implement an algorithm to find the largest interior angle of a convex polygon.
Extend the algorithm to work with any arbitrary polygon.
3) Find the horizontal line which bisects the area of a given convex polygon.