The Nicholl-Lee-Nicholl (NLN) algorithm for clipping line segments against a rectangular window in the plane (Computer Graphics 21,4 pp 253–262) was proved to be optimal recently in terms of the… (More)

It is demonstrated that power-efficient software also requires simplicity and the use of elementary data structures in addition to asymptotically optimal CPU and memory requirements. Though in the… (More)

The computer-graphics aspects of the visualization of large data sets, in particular, digital models of real or planned solid objects in a heterogeneous distributed environment are investigated. It… (More)

The algorithm proposed by Nicholl, Lee and Nicholl (Computer Graphics 21,4 pp 253–262) for clipping line segments against a rectangular window in the plane is proved to be optimal in terms of the… (More)

Performance evaluation techniques for fundamental graphics algorithms and for algorithms to be used in multimedia and embedded systems are investigated. Models of computation considering only… (More)