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 | Add to Reading ListSource URL: web.cs.swarthmore.eduDownload Document from Source WebsiteFile Size: 31,62 KBShare Document on Facebook |
Deformable Free Space Tilings for Kinetic Collision Detection Pankaj K. Agarwaly Julien Baschz Leonidas J. Guibasz John HershbergerxDocID: 1g096 - View Document | |
J Crespo et al., 2014 Int. J. Mech. Eng. & Rob. ResISSN 2278 – 0149 www.ijmerr.com Vol. 3, No. 2, April 2014DocID: 1awvn - View Document | |
CCCG 2010, Winnipeg MB, August 9–11, 2010 Hausdorff Core of a One Reflex Vertex Polygon Robert Fraser∗ AbstractDocID: 18TNg - View Document | |
UCDP GED Conflict Polygons Dataset Codebook Version 1.1 In force as of 15 March 2011DocID: 18R8v - View Document | |
CCCG 2006, Kingston, Ontario, August 14–16, 2006 Computing the Tool Path of an Externally Monotone Polygon in Linear Time∗ Prosenjit Bose† 1DocID: 18LQT - View Document |