2 research outputs found
Polynomial time algorithms to approximate mixed volumes within a simply exponential factor
Let K = (K1...Kn) be a n-tuple of convex compact subsets in the Euclidean space R n, and let V (路) be the Euclidean volume in R n. The Minkowski polynomial VK is defined as VK(x1,..., xn) = V (位1K1 +... + 位nKn) and the mixed volume V (K1,..., Kn) as V (K1...Kn) = 鈭俷 VK(位1K1 + 路 路 路位nKn)