In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and ...In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and vertical segments and having at mort k bends? Any such graph is said tobe k--rectilinear. No matter what k is, an obvious necessary condition for k-rectilinearity is that thedegree of each vertex does not exceed four.Our main result is that every planar graph H satisfying this condition is 3--rectilinear:in fact,it is 2--rectilinear with the only exception of the octahedron. We also outline a polynomial-timealgorithm which actually constructs a plane embedding of H with at most 2 bends (3 bends if H isthe octahedron) on each edge. The resulting embedding has the property that the total number ofbends does not exceed 2n, where n is the number of vertices of H.展开更多
The limited area 5-level primitive equation model,as the first operational precipitation forecast model in China,has been run at Beijing (National) Meteorological Center (BMC) for more than four years.The opera- tiona...The limited area 5-level primitive equation model,as the first operational precipitation forecast model in China,has been run at Beijing (National) Meteorological Center (BMC) for more than four years.The opera- tional results show that this model gives continuous services,and the forecast skill is satisfied for the forecast of some weather situations,such as extratropical cyclone,front and the precipitation associated with them. The forecast guides are widely used at the local weather services now.展开更多
文摘In the design of certain kinds of electronic circuits the following question arises:given a non-negative integer k, what graphs admit of a plane embedding such that every edge is a broken lineformed by horizontal and vertical segments and having at mort k bends? Any such graph is said tobe k--rectilinear. No matter what k is, an obvious necessary condition for k-rectilinearity is that thedegree of each vertex does not exceed four.Our main result is that every planar graph H satisfying this condition is 3--rectilinear:in fact,it is 2--rectilinear with the only exception of the octahedron. We also outline a polynomial-timealgorithm which actually constructs a plane embedding of H with at most 2 bends (3 bends if H isthe octahedron) on each edge. The resulting embedding has the property that the total number ofbends does not exceed 2n, where n is the number of vertices of H.
文摘The limited area 5-level primitive equation model,as the first operational precipitation forecast model in China,has been run at Beijing (National) Meteorological Center (BMC) for more than four years.The opera- tional results show that this model gives continuous services,and the forecast skill is satisfied for the forecast of some weather situations,such as extratropical cyclone,front and the precipitation associated with them. The forecast guides are widely used at the local weather services now.
