This preview shows page 1. Sign up to view the full content.
Unformatted text preview: vertices and a list of vertices from a file (counterclockwise 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/algo3chull20070206.pdf PART 2: 4 . (40 points) Write a CGAL program to solve the 3D version of the onion peeling problem described on p. 99100 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.
 Spring '10
 DANIELS
 Algorithms

Click to edit the document details