Algorithm for a minimal convex polyhedron to cover given points in 3-dimensional space

被引：0

作者：

机构：

来源：

Wuhan Jiaotong Keji Daxue Xuebao | / 2卷 / 154-157期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] DETERMINING 3-DIMENSIONAL CONVEX HULL OF A POLYHEDRON
APPEL, A
WILL, PM
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1976, 20 (06) : 590 - 601
[2] Convex hulls in a 3-dimensional space
Kovalevsky, Vladimir
Schulz, Henrik
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3322 : 176 - 196
[3] Convex hulls in a 3-dimensional space
Kovalevsky, V
Schulz, H
COMBINATORIAL IMAGE ANALYSIS, PROCEEDINGS, 2004, 3322 : 176 - 196
[4] THE IMPLEMENTATION OF AN ALGORITHM TO FIND THE CONVEX-HULL OF A SET OF 3-DIMENSIONAL POINTS
DAY, AM
ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (01): : 105 - 132
[5] LOCATING FACILITIES IN 3-DIMENSIONAL SPACE BY CONVEX PROGRAMMING
LOVE, RF
NAVAL RESEARCH LOGISTICS QUARTERLY, 1969, 16 (04): : 503 - &
[6] AN OPTIMAL ALGORITHM FOR INTERSECTING 3-DIMENSIONAL CONVEX POLYHEDRA
CHAZELLE, B
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 586 - 591
[7] AN OPTIMAL ALGORITHM FOR INTERSECTING 3-DIMENSIONAL CONVEX POLYHEDRA
CHAZELLE, B
SIAM JOURNAL ON COMPUTING, 1992, 21 (04) : 671 - 696
[8] ALGORITHM FOR MAXIMIZING A LINEAR FUNCTION ON THE SET OF INTEGRAL POINTS OF A CONVEX POLYHEDRON
TYU, NN
CYBERNETICS, 1986, 22 (05): : 622 - 627
[9] TOPOLOGICAL PROBLEMS OF LINES AND POINTS OF THE 3-DIMENSIONAL SPACE
VIRO, OJ
DOKLADY AKADEMII NAUK SSSR, 1985, 284 (05): : 1049 - 1052
[10] Remarks on minimal surfaces in a 3-dimensional Randers space
Hou Z.-H.
Liu Y.-N.
Journal of Geometry, 2018, 109 (1)

← 1 2 3 4 5 →