Question: give a pseudo code algorithm that computes in on log...
Give a pseudo code algorithm that computes, in O(n log n) time, a diagonal that splits a simple polygon with n vertices into two simple polygons each with at most
vertices. Hint: use a triangulation.
Please give the complete pseudo code!