Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Let S be a set of n points in the plane. We show how to process, on-line, a sequence of r point queries for computing their nearest neighbors in S, in time Θ((n + r) log min(n, r)). This settles an open problem posed by Karp. Motwani and Raghavan. © 1991.
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering