This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: AMS 345/CSE 355 (Spring, 2009) Joe Mitchell COMPUTATIONAL GEOMETRY Homework Set # 2 Due at the beginning of class on Wednesday, February 18, 2009. Recommended Reading: ORourke, Chapter 1 (sections 1.31.6) and Chapter 2 (sections 2.12.2). Reminder: In all of the exercises, be sure to give at least a brief explanation or justification for each claim that you make. (1). [20 points] (Based on ORourke, problem 3, section 1.3.9, page 24. ) A simple polygon P is specified by a list of vertices, v , v 1 , . . . , v n . While we generally assume that the list is given in counterclockwise (ccw) orientation, in practice the list is often given in either orientation (cw or ccw). Using the proof of Lemma 1.2.1 ( Every polygon must have at least one strictly convex vertex ) to guide your thought process, give an efficient algorithm to test the orientation of the sequence v , v 1 , . . . , v n of vertices of a simple polygon: Your algorithm should determine if the orientation is cw or ccw. What is the efficiency (running time in terms of big-Oh notation, as a function ofcw or ccw....
View Full Document
This note was uploaded on 02/07/2010 for the course AMS 345 taught by Professor Mitchell,j during the Spring '08 term at SUNY Stony Brook.
- Spring '08