On the algorithmic complexity of Minkowski's reconstruction theorem

In 1903 Minkowski showed that, given pairwise different unit vectors u₁, ... ,u_m in Euclidean n-space ℝⁿ which span ℝⁿ, and positive reals μ₁, ... ,μ_m such that Σ^m_i=1μ_iu_i = 0, there exists a polytope P in ℝⁿ, unique up to translation, with outer unit facet normals u₁, ...,u_m and corresponding facet volumes μ₁, ...,μ_m. This paper deals with the computational complexity of the underlying reconstruction problem, to determine a presentation of P as the intersection of its facet halfspaces. After a natural reformulation that reflects the fact that the binary Turing-machine model of computation is employed, it is shown that this reconstruction problem can be solved in polynomial time when the dimension is fixed but is #ℙ-hard when the dimension is part of the input. The problem of 'Minkowski reconstruction' has various applications in image processing, and the underlying data structure is relevant for other algorithmic questions in computational convexity.