OPTIMAL SHORTEST-PATH QUERIES IN A SIMPLE POLYGON

被引：123
|
作者：
GUIBAS, LJ [1 ]
HERSHBERGER, J [1 ]
机构：
[1] DIGITAL EQUIPMENT CORP,SYST RES CTR,PALO ALTO,CA 94301
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1989年 / 39卷 / 02期
关键词：
D O I：
10.1016/0022-0000(89)90041-X
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：126 / 152
页数：27
相关论文
共 50 条
  • [1] A NEW DATA STRUCTURE FOR SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
    HERSHBERGER, J
    [J]. INFORMATION PROCESSING LETTERS, 1991, 38 (05) : 231 - 235
  • [2] An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon
    Schuierer, S
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 205 - 225
  • [3] Shortest-Path Queries in Static Networks
    Sommer, Christian
    [J]. ACM COMPUTING SURVEYS, 2014, 46 (04)
  • [4] Parallel Shortest-Path Queries in Planar Graphs
    Aleksandrov, Lyudmil
    Chapuis, Guillaume
    Djidjev, Hristo
    [J]. PROCEEDINGS OF THE ACM WORKSHOP ON HIGH PERFORMANCE GRAPH PROCESSING (HPGP'16), 2016, : 9 - 16
  • [5] Shortest path queries in a simple polygon for 3D virtual museum
    Yang, Chenglei
    Qi, Meng
    Wang, Jiaye
    Wang, Xiaoting
    Meng, Xiangxu
    [J]. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 1, PROCEEDINGS, 2007, 4705 : 110 - +
  • [6] COMPUTING THE SHORTEST-PATH TREE IN A WEAK VISIBILITY POLYGON
    GHOSH, SK
    MAHESHWARI, A
    PAL, SP
    SALUJA, S
    MADHAVAN, CEV
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 560 : 369 - 389
  • [7] SHORTEST-PATH WITHIN POLYGON AND BEST PATH AROUND OR THROUGH BARRIERS
    XIONG, YH
    SCHNEIDER, JB
    [J]. JOURNAL OF URBAN PLANNING AND DEVELOPMENT-ASCE, 1992, 118 (02): : 65 - 79
  • [8] Ultrafast Shortest-Path Queries via Transit Nodes
    Bast, Holger
    Funke, Stefan
    Matijevic, Domagoj
    [J]. SHORTEST PATH PROBLEM, 2009, 74 : 175 - 192
  • [9] Optimal routing in shortest-path data
    Ramakrishnan, KG
    Rodrigues, MA
    [J]. BELL LABS TECHNICAL JOURNAL, 2001, 6 (01) : 117 - 138
  • [10] SHORTEST-PATH SOLVES EDGE-TO-EDGE VISIBILITY IN A POLYGON
    TOUSSAINT, GT
    [J]. PATTERN RECOGNITION LETTERS, 1986, 4 (03) : 165 - 170
12345