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

被引:83
|
作者
SURI, S
机构
来源
关键词
D O I
10.1016/0734-189X(86)90127-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
引用
收藏
页码:99 / 110
页数:12
相关论文
共 50 条
  • [31] A Simple Algorithm for Submodular Minimum Linear Ordering
    Katzelnick, Dor
    Schwartzt, Roy
    2023 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2023, : 28 - 35
  • [32] COMPUTING THE LINK CENTER OF A SIMPLE POLYGON
    LENHART, W
    POLLACK, R
    SACK, J
    SEIDEL, R
    SHARIR, M
    SURI, S
    TOUSSAINT, G
    WHITESIDES, S
    YAP, C
    DISCRETE & COMPUTATIONAL GEOMETRY, 1988, 3 (03) : 281 - 293
  • [33] THE COMPUTATION OF THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME
    WERNER, G
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (05): : 451 - 458
  • [34] FINDING THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME
    SHIN, SY
    WOO, TC
    PATTERN RECOGNITION, 1986, 19 (06) : 453 - 458
  • [35] AN O(N LOG N) ALGORITHM FOR COMPUTING A LINK CENTER IN A SIMPLE POLYGON
    DJIDJEV, HN
    LINGAS, A
    SACK, JR
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 96 - 107
  • [36] Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
    Zarrabi, Mohammad Reza
    Charkari, Nasrollah Moghaddam
    FUNDAMENTA INFORMATICAE, 2021, 182 (03) : 301 - 319
  • [37] Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
    Zarrabi, Mohammad Reza
    Charkari, Nasrollah Moghaddam
    IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS, 2022, 17 (02): : 235 - 241
  • [38] Geodesic Frechet Distance Inside a Simple Polygon
    Cook, Atlas F.
    Wenk, Carola
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 7 (01)
  • [39] Geodesic frechet distance inside a simple polygon
    Cook, Atlas F.
    Wenk, Carola
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 193 - 204
  • [40] A LINEAR TIME ALGORITHM FOR TRIANGULATING A POINT-VISIBLE POLYGON
    WOO, TC
    SHIN, SY
    ACM TRANSACTIONS ON GRAPHICS, 1985, 4 (01): : 60 - 69