Problem
1. Write a routine to split a concave polygon using the vector method.
2. Write a routine to split a concave polygon using the rotational method.
3. Adapt the Liang-Barsky line-clipping algorithm to polygon clipping.
4. Set up a detailed algorithm for -Atherton polygon clipping assuming that the clipping window is a rectangle in standard position.
5. Devise an algorithm for Weiler-Atherton polygon clipping, where the clipping window can be any specified polygon.