Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
An O(n log3n) algorithm is presented for computing the longest diagonal of a simple n-gon. The longest diagonal problem requires the determination of two vertices of the polygon that are visible to each other and that are farthest from each other among all such pairs. This problem is a variation of the "biggest stick" problem for which the most efficient algorithm that is known, is O(n1.98) time. © 1990.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007