Question: Show that if a polygon with has O ( 1 ) turn vertices ( start / end / split / merge vertices ) , then

Show that if a polygon with has O(1) turn vertices (start/end/split/merge vertices), then the triangulation algorithm that we studied (monotone decomposition + monotone triangulation) can be made to run in O(n) time. (Hint: Our monotone decomposition plane-sweep algorithm starts with a sort. You should probably start by tackling there.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!