Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
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.
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Oliver Bodemer
IBM J. Res. Dev