Question: Give an algorithm that computes, in O(n log n) time, a diagonal that splits a simple polygon with n vertices into two simple polygons each
Give an 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.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
