CG_HW3_S10 - vertices and a list of vertices from a file...

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

View Full Document Right Arrow Icon
UML CS Advanced Algorithms (Computational Geometry) 91.504 Spring, 2010 Homework #3 Assigned : Thursday, 2/18 Due : Both parts: Thursday, 3/4 . This assignment covers O’Rourke textbook material in Chapters 3 and 4, and de Berg et al. Chapters 1 and 11, plus CGAL documentation. PART 1: 1. (20 points) p. 154, Exercise 4.7 (3) Polytope to tetrahedra. 2. (15 points) p. 154, Exercise 4.7 (6) Triangle intersecting cube. 3. (25 points) Write a CGAL program to solve the 2D version of the onion peeling problem described on p. 99-100 of the O’Rourke textbook. Your program should read number of
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: vertices and a list of vertices from a file (counter-clockwise polygon boundary); see code from Prof. Daniels. Print out the vertices of each layer. For practical motivation behind this problem, please see the following link: http://www.montefiore.ulg.ac.be/~briquet/algo3-chull-20070206.pdf PART 2: 4 . (40 points) Write a CGAL program to solve the 3D version of the onion peeling problem described on p. 99-100 of the ORourke textbook. As in Problem 3 above, your program should read a list of vertices from a file. Print out the vertices of each layer....
View Full 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