Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
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.
Pradip Bose
VTS 1998
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990