CG_HW1_S10

# CG_HW1_S10 - UML CS Advanced Algorithms (Computational...

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

UML CS Advanced Algorithms (Computational Geometry) 91.504 Spring, 2010 1 of 1 Homework Set #1 Assigned : Thursday, 1/28 Due : Thursday, 2/11 at start of lecture This assignment covers: O’Rourke textbook material in Chapters 1, 2 de Berg et al. textbook material in Chapters 1, 3 Introduction to CGAL 1. (15 points) O’Rourke: p. 15, Exercise 1.2.5 (2) Realization of Triangulations . 2. (15 points) de Berg et al .: p. 60, Exercise 3.2 Guarding a Rectilinear (Orthogonal) Polygon. 3. (15 points) Guarding an Orthogonally Convex Polygon: An orthogonally convex polygon is an orthogonal polygon whose intersection with any vertical or horizontal line consists of at most one connected component.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/13/2012 for the course CS 91.504 taught by Professor Daniels during the Spring '10 term at UMass Lowell.

Ask a homework question - tutors are online