Bowen Zhou, Bing Xiang, et al.
SSST 2008
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.
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975