Sample problems and algorithms 24 1

First Page		Document Content
Date: 2005-02-14 10:46:20 Convex geometry Computational geometry Euclidean plane geometry Convex hull Simple polygon Point in polygon Gift wrapping algorithm Vertex Convex and concave polygons Geometry Convex hull algorithms Polygons		Sample problems and algorithms 24 1 Add to Reading List Source URL: www.jn.inf.ethz.ch Download Document from Source Website File Size: 351,25 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