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 条

[1] A new fully projective O(lg N) line convex polygon intersection algorithm
Skala, Vaclav
VISUAL COMPUTER, 2025, 41 (02): : 1241 - 1249
[2] AN O(N LOG N) ALGORITHM FOR COMPUTING A LINK CENTER IN A SIMPLE POLYGON
DJIDJEV, HN
LINGAS, A
SACK, JR
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 96 - 107
[3] An O((log log n)2) time convex hull algorithm on reconfigurable meshes
Hayashi, T
Nakano, K
Olariu, S
FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 439 - 446
[4] A new fully projective O(log N) point-in-convex polygon algorithm: a new strategy
Skala, Vaclav
VISUAL COMPUTER, 2024,
[5] An improved O(Rlog log n + n) time algorithm for computing the longest common subsequence
Zhu, Daxin (dex@qztc.edu.cn), 2017, International Association of Engineers (44)
[6] An optimal algorithm for the intersection radius of a set of convex polygons
Jadhav, S
Mukhopadhyay, A
Bhattacharya, B
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1996, 20 (02): : 244 - 267
[7] AN OPTIMAL ALGORITHM FOR THE INTERSECTION RADIUS OF A SET OF CONVEX POLYGONS
JADHAV, S
MUKHOPADHYAY, A
BHATTACHARYA, B
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 92 - 103
[8] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
KIM, T
CHWA, KY
INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
[9] An O(N log N) algorithm for shape modeling
Malladi, R.
Sethian, J. A.
Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
[10] AN O(N LOG N) MANHATTAN PATH ALGORITHM
LIPSKI, W
INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102

← 1 2 3 4 5 →