CCCG 2011, Toronto ON, August 10–12, 2011 Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤ Abstract - Rotating calipers - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2011, Toronto ON, August 10–12, 2011 Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤ Abstract Add to Reading List Document Date: 2011-08-06 04:11:13 Open Document File Size: 628,28 KB Share Result on Facebook City Toronto / New York / / Country United States / / / Facility Tsinghua University / / IndustryTerm enumerative algorithm / clever algorithm / computing / polynomial solution / approximation algorithm / linear time algorithm / search space / / Organization National Natural Science Foundation of China Grant / Tsinghua University / IEEE Computer Society / / Person Yan Ke / L. J. Guibas / J. E. Boyce / Kevin Matulef / Kai Jin / R. L. Drysdale / III / N. Adlai De Pano / D. P. Dobkin / / Product M-16 / / ProvinceOrState New York / California / / Technology linear time algorithm / end Algorithm / clever algorithm / approximation algorithm / time algorithm / two algorithms / / URL http / SocialTag Convex geometry Triangles Circles Simple polygon Rectangle Square Area Circumscribed circle Rotating calipers Geometry

CCCG 2011, Toronto ON, August 10–12, 2011 Finding the Maximum Area Parallelogram in a Convex Polygon Kai Jin⇤ AbstractAdd to Reading List