Talk:Zonohedron

From Wikipedia, the free encyclopedia

You have new messages (last change).

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)
Retrieved from "http://en.wikipedia.org../../../z/o/n/Talk%7EZonohedron_d877.html"