Construction of the Convex Hull of a Set for a Minimum Number of Iterations

被引：0
作者：
V. V. Panyukov
机构：
[1] Institute of Mathematical Problems of Biology,
[2] Russian Academy of Sciences,undefined
来源：
Programming and Computer Software | 2003年 / 29卷
关键词：
Operating System; Artificial Intelligence; Convex Hull;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An algorithm for constructing the convex hull of a finite set of points in a d-dimensional space for a minimum number of iterations is proposed.
引用
收藏
页码：112 / 119
页数：7
相关论文
共 8 条
  • [1] Aurenhammer F.(1991)Voronoy Diagrams-A Survey of a Fundamental Geometric Data Structure ACM Comput. Surv. 23 345-405
  • [2] Barber C.B.(1996)The Quickhull Algorithm for Convex Hull ACM Trans. Math. Software 22 469-483
  • [3] Dobkin D.P.(1970)An Algorithm for Convex Polytope J. ACM 17 78-86
  • [4] Hundanpaa H.(1991)Constructing the Minimization Diagram of a Two-Parameter Problem Operations Res. Lett. 10 87-93
  • [5] Chand D.H.(undefined)undefined undefined undefined undefined-undefined
  • [6] Kapur S.S.(undefined)undefined undefined undefined undefined-undefined
  • [7] Fernandez-Baca D.(undefined)undefined undefined undefined undefined-undefined
  • [8] Srinivasan S.(undefined)undefined undefined undefined undefined-undefined
1