The two-dimensional bandwidth problem is to find an embedding of graph G in a grid graph in the plane so that the longest edges are as short as possible.
二维带宽问题是将图G的顶点嵌入平面格子图，使其最长的连线尽可能短。
The two dimensional bandwidth problem is to determine an embedding of graph G in a grid graph in the plane such that the longest edges are as short as possible.
二维带宽问题是：确定图G在平面格子上的一个嵌入，使得最长边尽可能短。
The quadrilateral grid graph of closed surfaces was obtained through surface slicing, offset point picking up, ordering of point array, 1d interpolation, and data merging.
经过曲面切片、型值点提取、点列排序、一维插值、数据融合，得到闭曲面四边形网格图。
The quadrilateral grid graph of closed surfaces was obtained through surface slicing, offset point picking up, ordering of point array, 1d interpolation, and data merging.
经过曲面切片、型值点提取、点列排序、一维插值、数据融合，得到闭曲面四边形网格图。
应用推荐