<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-08-21 11:35:38Computational geometry Euclidean plane geometry Rotating calipers Convex hull Area Convex and concave polygons Pi Minimum bounding box algorithms Approximations of π Geometry Convex geometry Polygons |
| 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 nDocID: 1rrZJ - View Document |
| A THEORY OF THE CARTOGRAPHIC LINE Thomas K. Peucker Simon Fraser UniversityDocID: 1rdlr - View Document |
| Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph VandeheyDocID: 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 13901DocID: 1r8dq - View Document |