Finding a shortest diagonal of a simple polygon in linear time

被引：0
|
作者：
机构：
来源：
Comput Geom Theory Appl | / 3卷 / 149期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Finding the convex hull of a simple polygon
    Sklansky, Jack
    PATTERN RECOGNITION LETTERS, 1982, 1 (02) : 79 - 83
  • [22] A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon
    Kavand, Pardis
    Mohades, Ali
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (03) : 391 - 402
  • [23] OPTIMAL SHORTEST-PATH QUERIES IN A SIMPLE POLYGON
    GUIBAS, LJ
    HERSHBERGER, J
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 39 (02) : 126 - 152
  • [24] 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
  • [25] A Simple Matlab Code for Finding the Kernel of a Simple Polygon
    Mazzia, Annamaria
    SSRN,
  • [26] 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
  • [27] 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
  • [28] THE COMPUTATION OF THE CONVEX-HULL OF A SIMPLE POLYGON IN LINEAR TIME
    WERNER, G
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1986, 5 (05): : 451 - 458
  • [29] Linear-time algorithm for finding approximate shortest common superstrings
    Ukkonen, Esko
    Algorithmica (New York), 1990, 5 (03): : 313 - 323
  • [30] A LINEAR-TIME ALGORITHM FOR FINDING APPROXIMATE SHORTEST COMMON SUPERSTRINGS
    UKKONEN, E
    ALGORITHMICA, 1990, 5 (03) : 313 - 323
12345