Efficient algorithm for transversal of disjoint convex polygons

被引：3
|
作者：
Chin, FYL
Wang, FL [1 ]
机构：
[1] Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Hong Kong, Hong Kong, Peoples R China
[2] Univ Hong Kong, Dept Comp Sci & Informat Syst, Hong Kong, Hong Kong, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 03期
关键词：
computational geometry; transversal; disjoint convex polygon; stabber;
D O I：
10.1016/S0020-0190(01)00322-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a set S of n disjoint convex polygons {P-i \ 1 less than or equal to i less than or equal to n} in a plane, each with k(i) vertices, the transversal problem is to determine whether there exists a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n log n) time, where N = Sigma(i)(n) (= 1) k(i) is the total number of vertices of the polygons. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：141 / 144
页数：4
相关论文
共 50 条
  • [1] Efficient algorithm for transversal of disjoint convex polygons (vol 83, pg 141, 2002)
    Chin, FYL
    Wang, FL
    INFORMATION PROCESSING LETTERS, 2003, 85 (01) : 53 - 53
  • [2] A new algorithm for the shortest path of touring disjoint convex polygons
    Lijuan, Wang
    Bo, Jiang
    Ansheng, Deng
    Qi, Wei
    Open Automation and Control Systems Journal, 2015, 7 (01): : 1364 - 1368
  • [3] A Fast Algorithm for Touring the Disjoint Convex Polygons in the Given Order
    Wang Lijuan
    He Dandan
    Hou Hongfeng
    Jiang Bo
    Ning Tao
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 107 - 111
  • [4] Reconfirmation of two results on disjoint empty convex polygons
    Wu, Liping
    Ding, Ren
    DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 216 - +
  • [5] An Efficient Algorithm for Touring a Sequence of given Convex Polygons in the Plane
    Xu, Changan
    Jiang, Bo
    Wang, Lijuan
    PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 74 - 78
  • [6] Efficient approximation of convex polygons
    Lopez, MA
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2000, 10 (05) : 445 - 452
  • [7] A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
    YANG Cheng-lei
    Journal of Zhejiang University Science A(Science in Engineering), 2006, (09) : 1522 - 1529
  • [8] An efficient collision detection algorithm of convex polygons based on Minkowski sum
    Geng, Qingjia
    Guo, Xijuan
    Zhang, Jianfei
    Zhang, Buying
    ICIC Express Letters, 2013, 7 (02): : 461 - 464
  • [9] New fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
    Yang C.-L.
    Qi M.
    Meng X.-X.
    Li X.-Q.
    Wang J.-Y.
    Journal of Zhejiang University-SCIENCE A, 2006, 7 (9): : 1522 - 1529
  • [10] An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments
    Li, Nan
    Jiang, Bo
    Li, Nannan
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND APPLICATION ENGINEERING (CSAE2018), 2018,
12345