THE MAXIMUM NUMBER OF INTERSECTIONS BETWEEN TWO RECTANGULAR PATHS  

作　　者：李乔 徐俊明 张忠良 

机构地区：[1]Department of Mathematics, University of Science and Technology of China, Hefei 230026, PRC

出　　处：《Chinese Science Bulletin》1992年第6期521-522,共2页

基　　金：Project supported by the National Natural Science Foundation of China. A preliminary version of this work was presented at the First Chinese SIAM Conference, Beijing. Nov. 1-3, 1990

摘　　要：In laying routes on printed circuit boards and VLSI chips, wires are usually allowed to run rectilinearly. This makes people consider the number of intersections between two rectangular paths on a plane. A Manhattan path on the plane consists of a horizontal line segment and a vertical line segment sharing a common endpoint. A rectangular path P

关 键 词：Manhattan ENDPOINT CHIPS LAYING printed RECTANGULAR sharing allowed HAVEN 代军 

分 类 号：N[自然科学总论]