Finding Large Sticks and Potatoes in polygons

Olaf Hall-Holt , Matya Katz , Piyush Kumar and J.S.B.Mitchell,
Most recent version of the associated paper Abstract We give efficient approximation algorithms for finding the longest line segment (``stick'') or the largest area convex body (``potato'') inside a polygon. Code Max Empty Ellipse Code You will need opengl, glut, glu and qhull installed on your system to compile and run the demo successfully. Also, the input program expects a dense sampling (uniform) in clockwise order, otherwise the program will not work.

Olaf Hall-Holt , Matya Katz , Piyush Kumar and J.S.B.Mitchell,

Most recent version of the associated paper

Abstract

We give efficient approximation algorithms for finding the longest line segment (``stick'') or the largest area convex body (``potato'') inside a polygon.

Code

Max Empty Ellipse Code

You will need opengl, glut, glu and qhull installed on your system to compile and run the demo successfully. Also, the input program expects a dense sampling (uniform) in clockwise order, otherwise the program will not work.