行星各地发现了他们成就的遗迹，尤其在主网格点相交处。
The remnants of their achievements can be found throughout the planet especially where the major grids points intersect.
若要插值多条相交曲线只需在交点处构造全对称三角网格。
If the interpolated curves intersect at point v, we can design a full symmetric triangle mesh at point v.
文中给出了二维网格结构的计算机上求平面上一组不相交简单物体透视困的算法，并给出了算法的时间复杂度。
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.
应用推荐