摘要
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体平行视图的算法。
An algorithm for determining the parallel view of a set of disjoint simple objects in the plane on a two dimensional mesh computer is given, with its correctness and time complexity analyzed.
出处
《电子科技》
1996年第4期19-22,共4页
Electronic Science and Technology
关键词
网格计算机
算法
平行视图
分治法
mesh computer, algorithm, parallel view, divide and conquer, time complexity