Optimization of rectilinear extensions of 4-regular graphs
Lan Pei · Journal of Zhoukou Normal University · 2006
According to the properties of rectilinear extensions of 4regular graphs, a linear time algorithm is designed to get rectilinear extensions of some particular kinds of 4regular graphs with the minimum total number of bends. In this paper , a generalized algorithm is provided to extend a 4regular graph to another 4regular graph through base rectilinear extension, through which the base rectilinear extension with the minimum total number of bends of the extended 4regular graph is naturally obtained from that of the original one.