SHORTEST-PATH BETWEEN 2 SIMPLE POLYGONS

被引：4
|
作者：
ASANO, T
ASANO, T
IMAI, H
机构：
[1] OSAKA ELECTROCOMMUN UNIV,FAC ENGN,NEYAGAWA,OSAKA 572,JAPAN
[2] KYUSHU UNIV,HIGASHI KU,FUKUOKA 812,JAPAN
来源：
INFORMATION PROCESSING LETTERS | 1987年 / 24卷 / 05期
关键词：
D O I：
10.1016/0020-0190(87)90150-5
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：285 / 288
页数：4
相关论文
共 50 条
  • [31] THE EQUITY CONSTRAINED SHORTEST-PATH PROBLEM
    GOPALAN, R
    BATTA, R
    KARWAN, MH
    COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) : 297 - 307
  • [32] Shortest-Path Percolation on Random Networks
    Kim, Minsuk
    Radicchi, Filippo
    Physical Review Letters, 2024, 133 (04)
  • [33] Computation of the reverse shortest-path problem
    Zhang, JZ
    Lin, YX
    JOURNAL OF GLOBAL OPTIMIZATION, 2003, 25 (03) : 243 - 261
  • [34] UNIVERSAL BEHAVIOR OF THE SHORTEST-PATH AGGREGATION
    WANG, XR
    WANG, XF
    PHYSICAL REVIEW A, 1992, 45 (02): : 1274 - 1277
  • [35] SHORTEST-PATH DISTANCES - AN AXIOMATIC APPROACH
    SMITH, TE
    GEOGRAPHICAL ANALYSIS, 1989, 21 (01) : 1 - 31
  • [36] EFFICIENT SHORTEST-PATH SIMPLEX ALGORITHMS
    GOLDFARB, D
    HAO, JX
    KAI, SR
    OPERATIONS RESEARCH, 1990, 38 (04) : 624 - 628
  • [37] A new algorithm for the shortest-path problem
    Elmasry, Amr
    Shokry, Ahmed
    NETWORKS, 2019, 74 (01) : 16 - 39
  • [38] EUCLIDEAN SHORTEST-PATH IN THE PRESENCE OF OBSTACLES
    CHEN, YM
    RAMANAN, P
    NETWORKS, 1991, 21 (03) : 257 - 265
  • [39] Optimal routing in shortest-path data
    Ramakrishnan, KG
    Rodrigues, MA
    BELL LABS TECHNICAL JOURNAL, 2001, 6 (01) : 117 - 138
  • [40] AN EMPIRICAL SURVEY OF SHORTEST-PATH ALGORITHMS
    MOFFAT, A
    NEW ZEALAND OPERATIONAL RESEARCH, 1983, 11 (02): : 153 - 163
12345