按照定义，平行线是在同一平面上永不相交的线。
Parallel lines are, by definition, lines on the same plane that never join.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
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.
设 P和 Q为平面内两个互不相交的简单多边形 ，若 P在平面内绕某点旋转 ，文中讨论了其旋转可移动性问题 。
Let P and Q be two nonintersecting simple polygons in the plane, this paper discusses the rotational movability of them if P rotates around a point and collides with Q .
应用推荐