Computational Geometry Column 50 Joseph O’Rourke∗

First Page		Document Content
Date: 2008-01-25 16:53:01 Euclidean plane geometry Convex geometry Polygon Polyhedron Convex hull Heiko Harborth Convex set Area Happy Ending problem Geometry Mathematics Convex analysis		Computational Geometry Column 50 Joseph O’Rourke∗ Add to Reading List Source URL: cs.smith.edu Download Document from Source Website File Size: 261,21 KB Share Document on Facebook

	The hamburger theorem Mikio Kano and Jan Kynˇcl EPFL Problem: Given n red and n blue points in the plane in general position, draw n DocID: 1rrZJ - View Document
	A THEORY OF THE CARTOGRAPHIC LINE Thomas K. Peucker Simon Fraser University DocID: 1rdlr - View Document
	Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph Vandehey DocID: 1rarG - View Document
	Raster-Vector Conversion Methods for Automated Cartography With Applications in Polygon Maps and Feature Analysis Shin-yi Hsu Department of Geography SUNY-Binghamton Binghamton, NY 13901 DocID: 1r8dq - View Document