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 | Source URL: web.cs.swarthmore.eduDownload Document from Source WebsiteFile Size: 31,62 KBShare Document on Facebook |
![]() | Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo MurotaDocID: 1v6lO - View Document |
![]() | Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo MurotaDocID: 1uq8J - View Document |
![]() | Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo MurotaDocID: 1uci8 - View Document |
![]() | Simplot_FinalLogo_FullColorDocID: 1rprR - View Document |
![]() | 75 Documenta Math. Who Solved the Hirsch Conjecture? ¨ nter M. ZieglerDocID: 1rnGl - View Document |