From the de Berg et al. Computational Geometry textbook:

1. 10 points. Problem 3.3
2. 10 points. Problem 3.6
3. 10 points. Problem 3.9 (Assume the triangulations are given as doubly-connected edge lists.)
4. 10 points. Problem 4.1
5. 10 points. Problem 4.14