AN O(N) ALGORITHM TO FIND A NEAR-OPTIMUM PARTITION OF A CONVEX POLYGON

被引：9
|
作者：
HU, TC
SHING, MT
机构：
来源：
JOURNAL OF ALGORITHMS | 1981年 / 2卷 / 02期
关键词：
D O I：
10.1016/0196-6774(81)90014-6
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：122 / 138
页数：17
相关论文
共 50 条
  • [1] A convex partition algorithm for a polygon with holes
    Jiao, Li-Nan
    Tang, Zhen-Min
    Binggong Xuebao/Acta Armamentarii, 2008, 29 (03): : 379 - 384
  • [2] A NEAR-OPTIMUM PARALLEL PLANARIZATION ALGORITHM
    TAKEFUJI, Y
    LEE, KC
    SCIENCE, 1989, 245 (4923) : 1221 - 1223
  • [3] Linear algorithm to find the largest intriangles of a planar convex polygon
    Pujari, AK
    Nataraj, A
    KYBERNETES, 1996, 25 (05) : 53 - &
  • [4] A near-optimum parallel algorithm for a graph layout problem
    Wang, RL
    Xu, XS
    Tang, Z
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (02) : 495 - 501
  • [5] A NEAR-OPTIMUM CATEGORIZATION ALGORITHM FOR CERTAIN ARTIFICIAL GAUSSIAN DATA
    ROSEN, CA
    HALL, DJ
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1966, 12 (02) : 277 - +
  • [6] An algorithm to find maximum area polygons circumscribed about a convex polygon
    Ausserhofer, Markus
    Dann, Susanna
    Langi, Zsolt
    Toth, Geza
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 98 - 108
  • [7] A Novel Near-Optimum Distributed Scheduling Algorithm for mmWave Mesh Networks
    Ibrahim, Muhammad K.
    Ismail, Mahmoud H.
    El-Kharashi, M. Watheq
    PROCEEDINGS OF 2016 11TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING & SYSTEMS (ICCES), 2016, : 133 - 137
  • [8] A new fully projective O(lg N) line convex polygon intersection algorithm
    Skala, Vaclav
    VISUAL COMPUTER, 2025, 41 (02): : 1241 - 1249
  • [9] AN O(N3) ALGORITHM FOR FINDING THE MINIMAL OPAQUE FOREST OF A CONVEX POLYGON
    DUBLISH, P
    INFORMATION PROCESSING LETTERS, 1988, 29 (05) : 275 - 276
  • [10] Algorithm and VLSI Architecture of a Near-Optimum Symbol Detector for QSM MIMO Systems
    Yen, Mao-Hsu
    Lu, Hoang-Yang
    Lu, Ken-Hua
    Lin, Shao-Yueh
    Chan, Chia-Chen
    IEEE ACCESS, 2023, 11 : 144113 - 144125
12345