可重迭分层次的图形窗口操作算法研究

Operation algorithms of hierarchical and overlapping windows

窗口技术作为一种方便而有效的人机界面已被越来越多的人所接受。虽然面向字符的窗口是非常有效的,但在许多应用场合要求窗口能支持图形功能,因而开发图形窗口的工作变得十分迫切了。本文讨论了一些窗口操作算法的实现策略并给出了一个分层次可重迭式图形窗口的具体算法,该算法是基于时间和空间复杂度考虑的,因而无论是从效率上还是资源占有量上看,该算法是非常有效和接近最优的。

In this paper, we present a series of algorithms to implement a powerful and complete graphic window system. These algorithms support arbitrarily branching hierarchy of resizable, overlappiny windows. Two critilal aspects of the algorithms are considered by the authors, namely the time complexity and the space complexity. Some delicate data styuctares in this paper are proposed and discussed. The main ideas buried in these data structures are that the sytem maintains a window node tree to reflect the window hieravchy and viewing relationship, and keeps a list of obscured region areas which record the number of other windows covering them for each window in the system. Haviny these considerations the algorithms are both efficient and spale saving.