This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revisionBoth sides next revision |
tutorial:coordinates [2014/01/03 15:45] – external edit 127.0.0.1 | user_guide:coordinates [2019/01/25 09:27] – ↷ Page moved from tutorial:coordinates to user_guide:coordinates oroehrig |
---|
</code> | </code> |
| |
Each line describes one linear inequality. The encoding is as follows: (a_0,a_1,...,a_d) is the inequality a_0 + a_1 x_1 + ... + a_d x_d >= 0. This way a point in homogeneous coordinates satisfies an inequality if and only if the scalar product of the point with the inequality gives a non-negative value. (Use the command ''print_constraints($m)'' to display the inequalities of the matrix ''$m'' in a nice way.) | Each line describes one linear inequality. The encoding is as follows: (a_0,a_1,...,a_d) is the inequality a_0 + a_1 x_1 + ... + a_d x_d >= 0. This way a point in (oriented) homogeneous coordinates satisfies an inequality if and only if the scalar product of the point with the inequality gives a non-negative value. (Use the command ''print_constraints($m)'' to display the inequalities of the matrix ''$m'' in a nice way.) |
| |
Clearly, the polyhedron is unbounded. | Clearly, the polyhedron is unbounded. |