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 条
  • [1] A linear time algorithm for minimum conic link path in a simple polygon
    Chou, Shuo-Yan
    Chou, Chang-Chien
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 45 : 286 - 293
  • [2] MINIMAL LINK VISIBILITY PATHS INSIDE A SIMPLE POLYGON
    ALSUWAIYEL, MH
    LEE, DT
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1993, 3 (01): : 1 - 25
  • [3] FINDING AN APPROXIMATE MINIMUM-LINK VISIBILITY PATH INSIDE A SIMPLE POLYGON
    ALSUWAIYEL, MH
    LEE, DT
    INFORMATION PROCESSING LETTERS, 1995, 55 (02) : 75 - 79
  • [4] A linear time algorithm to remove winding of a simple polygon
    Bhattacharya, BK
    Ghosh, SK
    Shermer, TC
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 33 (03): : 165 - 173
  • [5] A randomized algorithm for triangulating a simple polygon in linear time
    Amato, NM
    Goodrich, MT
    Ramos, EA
    DISCRETE & COMPUTATIONAL GEOMETRY, 2001, 26 (02) : 245 - 265
  • [6] A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
    N. M. Amato
    M. T. Goodrich
    E. A. Ramos
    Discrete & Computational Geometry, 2001, 26 : 245 - 265
  • [7] A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
    Hee-Kap Ahn
    Luis Barba
    Prosenjit Bose
    Jean-Lou De Carufel
    Matias Korman
    Eunjin Oh
    Discrete & Computational Geometry, 2016, 56 : 836 - 859
  • [8] A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
    Ahn, Hee-Kap
    Barba, Luis
    Bose, Prosenjit
    De Carufel, Jean-Lou
    Korman, Matias
    Oh, Eunjin
    DISCRETE & COMPUTATIONAL GEOMETRY, 2016, 56 (04) : 836 - 859
  • [9] Computing simple paths from given points inside a polygon
    Tan, Xuehou
    Jiang, Bo
    DISCRETE APPLIED MATHEMATICS, 2019, 252 : 67 - 76
  • [10] A LINEAR TIME ALGORITHM FOR OBTAINING THE CONVEX-HULL OF A SIMPLE POLYGON
    GHOSH, SK
    SHYAMASUNDAR, RK
    PATTERN RECOGNITION, 1983, 16 (06) : 587 - 592
12345