摘要
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
An algorithm for determining the perspective view of a set of disjoint simple objects in the plane on a two-dimensional mesh computer is presented with its time complexity given.
关键词
网格计算机
算法
透视图
时间复杂度
mesh computer, algorithm, perspective view, time complexity
