<--- Back to Details
First PageDocument Content
Computational geometry / Euclidean plane geometry / Rotating calipers / Convex hull / Area / Convex and concave polygons / Pi / Minimum bounding box algorithms / Approximations of π / Geometry / Convex geometry / Polygons
Date: 2009-08-21 11:35:38
Computational geometry
Euclidean plane geometry
Rotating calipers
Convex hull
Area
Convex and concave polygons
Pi
Minimum bounding box algorithms
Approximations of π
Geometry
Convex geometry
Polygons

Add to Reading List

Source URL: web.cs.swarthmore.edu

Download Document from Source Website

File Size: 31,62 KB

Share Document on Facebook

Similar Documents

Geometry / Mathematics / Space / Linear algebra / Euclidean geometry / Ham sandwich theorem / Hyperplane

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

Geometry / Mathematics / Space / Polygons / Elementary geometry / Euclidean plane geometry / Convex geometry / Convex polygon / Computational geometry / Point in polygon / Star polygon / Perpendicular

A THEORY OF THE CARTOGRAPHIC LINE Thomas K. Peucker Simon Fraser University

DocID: 1rdlr - View Document

Geometry / Mathematics / Space / Circles / Elementary geometry / Conformal geometry / Euclidean plane geometry / Discrete geometry / Sphere packing / Circle packing / Sphere / Apollonian circles

Illinois Geometry Lab Apollonian Circle Packing Density Author: Joseph Vandehey

DocID: 1rarG - View Document

Geographic information systems / Graphics file formats / Cartography / Computer graphics / Euclidean plane geometry / Polygon / Raster graphics / Raster data / Image segmentation / Map / Geometry / Computing

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