Unformatted text preview: having these points on its boundary. Analyze the complexity of your algorithm. 3. Let P be a non-convex polygon. Describe an algorithm that computes the convex hull of P in O(n). 4. Using Euler’s formula as a starting point, prove the following inequalities for a planar graph with the additional property that each vertex has degree greater than or equal to 3; a. e v 3 2 ≤ b. 6 3-≤ f e c. e f 3 2 ≤ d. 6 3-≤ v e e. 4 2-≤ f v f. 4 2-≤ v f Also prove that if a planar graph is triangulated (that is every face is a triangle. Note in this case some vertices may have degree less than 3) then 6 3-= v e ....
View Full Document
This note was uploaded on 10/04/2011 for the course COT 5520 taught by Professor Mukherjee during the Spring '11 term at University of Central Florida.
- Spring '11