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 条

[11] An O(N log N) algorithm for shape modeling
Malladi, R
Sethian, JA
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
[12] AN O(LOG N) ALGORITHM FOR COMPUTING PERIODIC CONTINUED FRACTIONS AND ITS APPLICATIONS
LIN, SS
LIN, FC
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1991, 21 (2-3) : 1 - 6
[13] An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees
Bryant, David
Scornavacca, Celine
ALGORITHMICA, 2019, 81 (09) : 3692 - 3706
[14] An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology
G. Xue
D.-Z. Du
Algorithmica, 1999, 23 : 354 - 362
[15] An O(n log n) average time algorithm for computing the shortest network under a given topology
Xue, G
Du, DZ
ALGORITHMICA, 1999, 23 (04) : 354 - 362
[16] AN ALGORITHM FOR COMPUTING THE UNION, INTERSECTION OR DIFFERENCE OF 2 POLYGONS
MARGALIT, A
KNOTT, GD
COMPUTERS & GRAPHICS, 1989, 13 (02) : 167 - 183
[17] Algorithm for computing the union, intersection or difference of two polygons
Margalit, Avraham, 1600, (13):
[18] COMPUTING MINIMAL TRIANGULATIONS IN TIME O(nα log n) = o(n2.376)
Heggernes, Pinar
Telle, Jan Arne
Villanger, Yngve
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (04) : 900 - 913
[19] Computing Minimal Triangulations in Time O(nα log n) = o(n2.376)
Heggernes, Pinar
Telle, Jan Arne
Villanger, Yngve
PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 907 - 916
[20] An O(log n log log n) space algorithm for undirected st-connectivity
Trifonov, Vladimir
SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483

← 1 2 3 4 5 →