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

First Page		Document Content
Date: 2006-05-07 23:58:40 Convex analysis Convex geometry Computational geometry Regular polygon Convex hull algorithms Vertex Convex hull Dual polyhedron Internal and external angle Geometry Polygons Euclidean plane 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 polyg Add to Reading List Source URL: mesh.brown.edu Download Document from Source Website File Size: 155,15 KB Share Document on Facebook

	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota DocID: 1v6lO - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota DocID: 1uq8J - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota DocID: 1uci8 - View Document
	Simplot_FinalLogo_FullColor DocID: 1rprR - View Document
	75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. Ziegler DocID: 1rnGl - View Document