Talk:Zonohedron
From Wikipedia, the free encyclopedia
Given a zonotope defined by k vectors in n dimensional space (k>=n), is there an algorithm for determining if point p is inside the zonotope?
- Sure. It's an example of a linear programming feasibility problem with equality constraints: p is in the zonotope iff there exist xi, 0≤xi≤1, s.t. p = Σxivi. So any linear programming algorithm will solve it. —David Eppstein 07:23, 7 September 2006 (UTC)
[edit] Dimension?
I don't know what the just added dimension column means. Tom Ruen 21:25, 23 May 2007 (UTC)