Conference paper
Failure diagnosis with incomplete information in cable networks
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
Paper
Computing the longest diagonal of a simple polygon
Abstract
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.
Related
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006