DETERMINING SHORTEST NETWORKS IN THE EUCLIDEAN PLANE

被引：0
|
作者：
WENG, JF [1 ]
机构：
[1] UNIV MELBOURNE,DEPT MATH,PARKVILLE,VIC 3052,AUSTRALIA
来源：
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY | 1994年 / 49卷 / 02期
关键词：
D O I：
10.1017/S0004972700016427
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：349 / 350
页数：2
相关论文
共 50 条
  • [1] A New Algorithm for Euclidean Shortest Paths in the Plane
    Wang, Haitao
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 975 - 988
  • [2] An optimal algorithm for Euclidean shortest paths in the plane
    Hershberger, J
    Suri, S
    SIAM JOURNAL ON COMPUTING, 1999, 28 (06) : 2215 - 2256
  • [3] A New Algorithm for Euclidean Shortest Paths in the Plane
    Wang, Haitao
    JOURNAL OF THE ACM, 2023, 70 (02)
  • [4] Shortest Directed Networks in the Plane
    Maxwell, Alastair
    Swanepoel, Konrad J.
    GRAPHS AND COMBINATORICS, 2020, 36 (05) : 1457 - 1475
  • [5] Shortest Directed Networks in the Plane
    Alastair Maxwell
    Konrad J. Swanepoel
    Graphs and Combinatorics, 2020, 36 : 1457 - 1475
  • [6] Two-point Euclidean shortest path queries in the plane
    Chiang, YJ
    Mitchell, JSB
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 215 - 224
  • [7] ON SHORTEST NETWORKS FOR CLASSES OF POINTS IN THE PLANE
    IHLER, E
    REICH, G
    WIDMAYER, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 553 : 103 - 111
  • [8] An improved algorithm for euclidean shortest paths of visiting line segments in the plane
    Wang L.
    Huo L.
    He D.
    Journal of Convergence Information Technology, 2011, 6 (06) : 119 - 126
  • [9] An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
    Kapoor, S
    Maheshwari, SN
    Mitchell, JSB
    DISCRETE & COMPUTATIONAL GEOMETRY, 1997, 18 (04) : 377 - 383
  • [10] An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
    S. Kapoor
    S. N. Maheshwari
    J. S. B. Mitchell
    Discrete & Computational Geometry, 1997, 18 : 377 - 383
12345