CS 157: Assignment 6 Douglas R. Lanman 8 May 2006 Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polyg - Polygon mesh - Document - PDFSEARCH.IO

First Page	Meta Content
	CS 157: Assignment 6 Douglas R. Lanman 8 May 2006 Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polyg Add to Reading List Document Date: 2006-05-07 23:58:40 Open Document File Size: 155,15 KB Share Result on Facebook Company Vertex / MIT Press / McGraw-Hill / / IndustryTerm vetex-ordering algorithms / cross product / divide-and-conquer solution / convex hull algorithms / linear search / / Organization pentagon / MIT / / Person Michael I. Shamos / Clifford Stein / Charles E. Leiserson / Douglas R. Lanman / Franco P. Preparata / Ronald L. Rivest / Thomas H. Cormen / Jeff Erickson / / Technology convex hull algorithms / vetex-ordering algorithms / / URL http / SocialTag Convex analysis Convex geometry Computational geometry Regular polygon Convex hull algorithms Vertex Convex hull Dual polyhedron Internal and external angle Geometry

CS 157: Assignment 6 Douglas R. Lanman 8 May 2006 Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polygAdd to Reading List