Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
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.
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University