3-PA-dueNov20

3-PA-dueNov20 - CSC 3102 Programming Assignment 3 Convex...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 3102 Programming Assignment 3 Convex Hull Problem Due: November 20, Thursday (by 11:55 pm) Points: 5 plus a bonus of 3 Penalty: You will lose one point per delayed day Submit your work as instructed towards the end of this document. Contact TA Di Lin by e- mail to dlin4@lsu.edu or me by e-mail to karki@csc.lsu.edu for help. Objective: Implement an algorithm to find a convex hull for given sets of points on a plane. Background: The convex-hull problem is the problem of finding the smallest convex polygon (that is, convex hull) that contains a given set of n points in the plane. In the class, we have discussed two algorithms for solving the problem. The brute-force algorithm (section 3.3 of the text book and the lecture note) is based on the fact that a line segment connecting any two points of a given set of n points is a part of the convex hull’s boundary if and only if all the other points of the set lie on the same side of the straight line through these two points. This requires checking whether the expression (
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Page1 / 2

3-PA-dueNov20 - CSC 3102 Programming Assignment 3 Convex...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online