A LINEAR TIME ALGORITHM FOR MINIMUM LINK PATHS INSIDE A SIMPLE POLYGON

被引：83
|
作者：
SURI, S
机构：
来源：
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING | 1986年 / 35卷 / 01期
关键词：
D O I：
10.1016/0734-189X(86)90127-1
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：99 / 110
页数：12
相关论文
共 50 条
  • [41] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
    Joseph S. B. Mitchell
    Valentin Polishchuk
    Mikko Sysikaski
    Haitao Wang
    Algorithmica, 2019, 81 : 289 - 316
  • [42] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
    Mitchell, Joseph S. B.
    Polishchuk, Valentin
    Sysikaski, Mikko
    Wang, Haitao
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 947 - 959
  • [43] An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
    Mitchell, Joseph S. B.
    Polishchuk, Valentin
    Sysikaski, Mikko
    Wang, Haitao
    ALGORITHMICA, 2019, 81 (01) : 289 - 316
  • [44] A LINEAR ALGORITHM FOR BISECTING A POLYGON
    SHERMER, TC
    INFORMATION PROCESSING LETTERS, 1992, 41 (03) : 135 - 140
  • [45] THE COMPUTATION OF THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME - COMMENT
    ELGINDY, H
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1987, 6 (05): : 437 - 440
  • [46] Minimum-link paths revisited
    Mitchell, Joseph S. B.
    Polishchuk, Valentin
    Sysikaski, Mikko
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2014, 47 (06): : 651 - 667
  • [47] AN 0(N-LOG-N) ALGORITHM FOR COMPUTING THE LINK CENTER OF A SIMPLE POLYGON
    DJIDJEV, HN
    LINGAS, A
    SACK, JR
    DISCRETE & COMPUTATIONAL GEOMETRY, 1992, 8 (02) : 131 - 152
  • [48] ON SOME LINK DISTANCE PROBLEMS IN A SIMPLE POLYGON
    SURI, S
    IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1990, 6 (01): : 108 - 113
  • [49] A LINEAR-TIME ALGORITHM FOR COMPUTING THE VORONOI DIAGRAM OF A CONVEX POLYGON
    AGGARWAL, A
    GUIBAS, LJ
    SAXE, J
    SHOR, PW
    DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (06) : 591 - 604
  • [50] A LINEAR TIME ALGORITHM FOR FINDING ALL FARTHEST NEIGHBORS IN A CONVEX POLYGON
    AGGARWAL, A
    KRAVETS, D
    INFORMATION PROCESSING LETTERS, 1989, 31 (01) : 17 - 20
12345