节点文献

THE MAXIMUM NUMBER OF INTERSECTIONS BETWEEN TWO RECTANGULAR PATHS

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具，请取消加速工具后下载。

【作者】 李乔； 徐俊明； 张忠良；

【Author】 LI QIAO XU JUN-MING ZHANG ZHONG-LIANG (Department of Mathematics, University of Science and Technology of China, Hefei 230026, PRC)

【机构】 Department of Mathematics； University of Science and Technology of China； Hefei 230026； PRC； PRC；

【摘要】 <正> 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 consists

【关键词】 Manhattan； endpoint； chips； laying； printed； rectangular； sharing； allowed； haven； 代军；
【基金】 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
  • 【文献出处】 Chinese Science Bulletin ,科学通报(英文版) , 编辑部邮箱 ,1992年06期
  • 【下载频次】8
打印本页
节点文献中：