LecXX3

# LecXX3 - 1 3/30/10 COT 6936 1 COT 6936: Topics in...

This preview shows pages 1–4. Sign up to view the full content.

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 3/30/10 COT 6936 1 COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu http://www.cs.fiu.edu/~giri/teach/COT6936_S10.html https://online.cis.fiu.edu/portal/course/view.php?id=427 Convex Polygons Convex region : A region in space is called convex if line joining any two points in the region is completely contained in the region. Convex hull of a set of points, S, is the smallest convex region containing S. 3/30/10 COT 6936 2 Rubber Band Analogy 3/30/10 COT 6936 3 2 Convex vs Non-convex Non-convex polygons 3/30/10 COT 6936 4 3D convex hulls 3/30/10 COT 6936 5 Convex Hull: Graham Scan applet http://www.personal.kent.edu/~rmuhamma/ Compgeometry/MyCG/ConvexHull/ GrahamScan/grahamScan.htm Main cost: sorting O(n log n) 3/30/10 COT 6936 6 3 Package Wrapping: Jarvis March 3/30/10 COT 6936 7 Package Wrapping: Jarvis March Time complexity (Cost of iteration) X (# iterations) Each iteration: O(n) Number of iterations = O(n)...
View Full Document

## This note was uploaded on 02/18/2012 for the course CIS 6936 taught by Professor Giri during the Spring '12 term at FIU.

### Page1 / 4

LecXX3 - 1 3/30/10 COT 6936 1 COT 6936: Topics in...

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

View Full Document
Ask a homework question - tutors are online