Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities
Three-Dimensional Polyhedra Can Be Described by Three Polynomial Inequalities
复制标题
三维多面体可以用三个多项式不等式来描述
DOI:
10.1007/s00454-009-9183-1
复制
发表时间:
2009
影响因子:
0.8
通讯作者:
Averkov
中科院分区:
文献类型:
--
作者:
Averkov
Bosse et al. conjectured that for every natural number d≥2 and every d-dimensional polytope P in ℝ d , there exist d polynomials p 1(x),…,p d (x) satisfying P={x∈ℝ d :p 1(x)≥0,…,p d (x)≥0}. We show that every three-dimensional polyhedron can be described by three polynomial inequalities, which confirms the conjecture for the case d=3 but also provides an analogous statement for the case of unbounded polyhedra. The proof of our result is constructive.
DOI:
--
发表时间:
2008
期刊:
IEEE Conference on Decision and Control
影响因子:
--
作者:
J. Helton;Jiawang Nie
通讯作者:
Jiawang Nie
影响因子:
2.7
作者:
Hartwig Bosse;M. Grötschel;M. Henk
通讯作者:
M. Henk
DOI:
--
发表时间:
2008
期刊:
影响因子:
--
作者:
G. Averkov
通讯作者:
G. Averkov