Exercises for Convexity of Polygons
1
Exercises for Convexity of Polygons Author: Kasun Ranga Wijeweera Email: [email protected] 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.
-
Upload
kasun-ranga-wijeweera -
Category
Software
-
view
19 -
download
0
Transcript of Exercises for Convexity of Polygons
Exercises for Convexity of Polygons
Author: Kasun Ranga Wijeweera
Email: [email protected]
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.
