[1]成德源,王华民.确定凸多面体全部顶点和非多余约束的一种算法[J].深圳大学学报理工版,1992,(3-4):36-40.
 Cheng Deyuan,Wang Huamin.An algorithm for Determining All Vertices & Nonredundant Constraints of Convex polyhedra[J].Journal of Shenzhen University Science and Engineering,1992,(3-4):36-40.
点击复制

确定凸多面体全部顶点和非多余约束的一种算法()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
期数:
1992年3-4期
页码:
36-40
栏目:
环境与能源
出版日期:
1992-12-31

文章信息/Info

Title:
An algorithm for Determining All Vertices & Nonredundant Constraints of Convex polyhedra
作者:
成德源1王华民2
(1)深圳大学电子工程系; (2)西安交通大学数学系
Author(s):
Cheng Deyuan1 Wang Huamin2
(1)Department of electronic engineering, Shenzhen University; (2)Department of mathematics, Xi’an Jiao Tong University
关键词:
线性不等式系统 凸多面体 多余约束
Keywords:
Linear inequality systemsConvex polyhedronRedundant constraints
摘要:
本文提出一种有效算法,不重复地循着由一个线性不等式系统所决定的凸多面体棱线仅一次访遍全部顶点,同时确定此系统中全部非多余约束。
Abstract:
An efficient algorithm to determine all vertices and nonredundant constraints of linear inequality systems is proposed. With this algorithm,every vertex of a convex polyhedron will be visited only once by non-repeatedly going along the edges. Meantime,all nonredundant constraints of the linear inequality systems can be determined。
更新日期/Last Update: 2016-05-10