针对4-正则图的平面嵌入的纵横扩张的特殊性,某些4-正则图类的最小折数纵横扩张已经有了线性算法.本文通过基纵横扩张,提供了从一个4-正则图扩充为另一个4-正则图的方式。使得从原图的最小折数基纵横扩张自然导出扩充图的最小折数基纵横扩张.
According to the properties of rectilinear extensions of 4-regular graphs, a linear time algorithm is designed to get rectilinear extensions of some particular kinds of 4-regular graphs with the minimum total number of bends. In this paper , a generalized algorithm is provided to extend a 4-regular graph to another 4-regular graph through base rectilinear extension, through which the base rectilinear extension with the minimum total number of bends of the extended ,t-regular graph is naturally obtained from that of the original one.