A NEW O(N.LOG-N) ALGORITHM FOR COMPUTING THE INTERSECTION OF CONVEX POLYGONS

被引：5
|
作者：
KUNDU, S
机构：
来源：
PATTERN RECOGNITION | 1987年 / 20卷 / 04期
关键词：
D O I：
10.1016/0031-3203(87)90067-7
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
引用
收藏
页码：419 / 424
页数：6
相关论文
共 50 条
  • [21] An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    OPERATIONS RESEARCH, 2017, 65 (04) : 1043 - 1061
  • [22] A new fully projective O(lg N) line convex polygon intersection algorithmA new fully projective O(lg N) line convex polygon intersection algorithmV. Skala
    Vaclav Skala
    The Visual Computer, 2025, 41 (2) : 1241 - 1249
  • [23] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [24] COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(n log n) TIME
    Weimann, Oren
    Yuster, Raphael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (02) : 609 - 616
  • [25] An O((log log n)2) time algorithm to compute the convex hull of sorted points on reconfigurable meshes
    Hayashi, T
    Nakano, K
    Olariu, S
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (12) : 1167 - 1179
  • [26] Computing the Girth of a Planar Graph in O (n log n) Time
    Weimann, Oren
    Yuster, Raphael
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 764 - +
  • [27] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
  • [28] An O(M(n) log n) Algorithm for the Jacobi Symbol
    Brent, Richard P.
    Zimmermann, Paul
    ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
  • [29] AN O(N LOG N) SET REFINEMENT ALGORITHM WITH APPLICATIONS
    RAO, NSV
    SRIDHAR, R
    IYENGAR, SS
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1991, 40 (3-4) : 129 - 138
  • [30] An O(n log n) algorithm for finding dissimilar strings
    Abbasi, S
    Sengupta, A
    INFORMATION PROCESSING LETTERS, 1997, 62 (03) : 135 - 139
12345