Can hospitals afford digital storage for imagery?
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
We consider the orthgonal clipping problem in a set of segments: Given a set of n segments in d-dimensional space, we preprocess them into a data structure such that given an orthogonal query window, the segments intersecting it can be counted/reported efficiently. We show that the efficiency of the data structure significantly depends on a geometric discrete parameter K named the projected-image complexity, which becomes Θ (n2) in the worst case but practically much smaller. If we use O(m) space, where K log4d-7 n ≥ m ≥ n log4d-7 n, the query time is O((K/m)1/2 logmax{4,4d-5} n). This is near to an Ω((K/m)1/2) lower bound.
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
T. Graham, A. Afzali, et al.
Microlithography 2000
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022