503_HW7_S11 - Two points of P are antipodal if there exist...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Algorithms 91.503 (section 201) Spring, 2011 Homework #7 Assigned: Tuesday, 4/12 Due: Tuesday, 4/19 at 5:30 p.m. This assignment covers textbook material in Chapter 33 (Computational Geometry). 1. (40 points) Ghostbusters and Ghosts : Problem 33-3 on p. 1045-1046 (a)-(b) of our textbook. For both parts (a) and (b), provide pseudocode, correctness justification, and upper bound on worst-case running time. 2. (20 points) Closest Pair : Exercise 33.4-1 on p. 1043 of our textbook. 3. (10 points) Antipodal Points and Convex Hull : Given a two-dimensional polygon P and a point p on its boundary, a line of support of P at p is a line L such that all of P is in one half-plane delimited by L.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Two points of P are antipodal if there exist parallel lines of support of P through the two points. Now consider the following statement: All of the antipodal points of a polygon are on the boundary of the convex hull of the polygon . Is the above statement true or false? Justify your answer. 4. (30 points) Line Segments and Convex Hull : Let L be a set of n line segments in the two-dimensional plane. Design an algorithm that produces the convex hull of L. Make the worst-case running time of your algorithm efficient. Provide pseudocode, correctness justification, and upper bound on worst-case running time....
View Full Document

This note was uploaded on 02/13/2012 for the course CS 91.503 taught by Professor Staff during the Spring '11 term at UMass Lowell.

Ask a homework question - tutors are online