首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
A HISTORICAL NOTE ON CONVEX-HULL FINDING ALGORITHMS
被引:17
|
作者
:
TOUSSAINT, GT
论文数:
0
引用数:
0
h-index:
0
TOUSSAINT, GT
机构
:
来源
:
PATTERN RECOGNITION LETTERS
|
1985年
/ 3卷
/ 01期
关键词
:
D O I
:
10.1016/0167-8655(85)90038-8
中图分类号
:
TP18 [人工智能理论];
学科分类号
:
081104 ;
0812 ;
0835 ;
1405 ;
摘要
:
引用
收藏
页码:21 / 28
页数:8
相关论文
共 50 条
[1]
A NOTE ON CONVEX-HULL ALGORITHMS
GHOSH, SK
论文数:
0
引用数:
0
h-index:
0
机构:
Tata Inst of Fundamental Research,, Computer Science Group, Bombay,, India, Tata Inst of Fundamental Research, Computer Science Group, Bombay, India
GHOSH, SK
PATTERN RECOGNITION,
1986,
19
(01)
: 75
-
75
[2]
HOW TO REDUCE THE AVERAGE COMPLEXITY OF CONVEX-HULL FINDING ALGORITHMS
DEVROYE, L
论文数:
0
引用数:
0
h-index:
0
DEVROYE, L
COMPUTERS & MATHEMATICS WITH APPLICATIONS,
1981,
7
(04)
: 299
-
308
[3]
FINDING THE CONVEX-HULL FACET BY FACET
SWART, G
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV WASHINGTON,DEPT COMP SCI,SEATTLE,WA 98195
UNIV WASHINGTON,DEPT COMP SCI,SEATTLE,WA 98195
SWART, G
JOURNAL OF ALGORITHMS,
1985,
6
(01)
: 17
-
48
[4]
ON FINDING THE CONVEX-HULL OF A SIMPLE POLYGON
LEE, DT
论文数:
0
引用数:
0
h-index:
0
LEE, DT
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES,
1983,
12
(02):
: 87
-
98
[5]
FINDING THE CONVEX-HULL OF A SIMPLE POLYGON
GRAHAM, RL
论文数:
0
引用数:
0
h-index:
0
机构:
BELL TEL LABS INC,MURRAY HILL,NJ 07974
GRAHAM, RL
YAO, FF
论文数:
0
引用数:
0
h-index:
0
机构:
BELL TEL LABS INC,MURRAY HILL,NJ 07974
YAO, FF
JOURNAL OF ALGORITHMS,
1983,
4
(04)
: 324
-
331
[6]
A NOTE ON GRAHAM CONVEX-HULL ALGORITHM
GRIES, D
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV NOVI SAD,INST MATH,YU-21000 NOVI SAD,YUGOSLAVIA
UNIV NOVI SAD,INST MATH,YU-21000 NOVI SAD,YUGOSLAVIA
GRIES, D
STOJMENOVIC, I
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV NOVI SAD,INST MATH,YU-21000 NOVI SAD,YUGOSLAVIA
UNIV NOVI SAD,INST MATH,YU-21000 NOVI SAD,YUGOSLAVIA
STOJMENOVIC, I
INFORMATION PROCESSING LETTERS,
1987,
25
(05)
: 323
-
327
[7]
EFFICIENT PARALLEL CONVEX-HULL ALGORITHMS
MILLER, R
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,ANN ARBOR,MI 48109
MILLER, R
STOUT, QF
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV MICHIGAN,DEPT ELECT ENGN & COMP SCI,ANN ARBOR,MI 48109
STOUT, QF
IEEE TRANSACTIONS ON COMPUTERS,
1988,
37
(12)
: 1605
-
1618
[8]
ON THE COMPLEXITY OF FINDING THE CONVEX-HULL OF A SET OF POINTS
AVIS, D
论文数:
0
引用数:
0
h-index:
0
AVIS, D
DISCRETE APPLIED MATHEMATICS,
1982,
4
(02)
: 81
-
86
[9]
THE COMPLEXITY OF INCREMENTAL CONVEX-HULL ALGORITHMS IN RD
KALLAY, M
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV OKLAHOMA,NORMAN,OK 73019
UNIV OKLAHOMA,NORMAN,OK 73019
KALLAY, M
INFORMATION PROCESSING LETTERS,
1984,
19
(04)
: 197
-
197
[10]
Convex-Hull Algorithms: Implementation, Testing, and Experimentation
Gamby, Ask Neve
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Copenhagen, Dept Comp Sci, Univ Pk 5, DK-2100 Copenhagen East, Denmark
Tech Univ Denmark, Natl Space Inst, DK-2800 Lyngby, Denmark
Univ Copenhagen, Dept Comp Sci, Univ Pk 5, DK-2100 Copenhagen East, Denmark
Gamby, Ask Neve
Katajainen, Jyrki
论文数:
0
引用数:
0
h-index:
0
机构:
Univ Copenhagen, Dept Comp Sci, Univ Pk 5, DK-2100 Copenhagen East, Denmark
Jyrki Katajainen & Co, DK-3390 Hundested, Denmark
Univ Copenhagen, Dept Comp Sci, Univ Pk 5, DK-2100 Copenhagen East, Denmark
Katajainen, Jyrki
ALGORITHMS,
2018,
11
(12):
←
1
2
3
4
5
→