Optimal placement of convex polygons to maximize point containment

Matthew T. Dickerson and Daniel Scharstein
Computational Geometry Theory & Applications 11(1):1–16, Aug 1998
Proc. 7th Symp. Discrete Algorithms, ACM and SIAM, Jan 1996, pp. 114–121
http://www.middlebury.edu/~scharste/rotate/rotate.ps.gz

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!