Abstract:
Given a set M subset Z3, an enclosing polyhedron for M is any polyhedron P such that the set of integer points contained in P is precisely M . Representing a discrete volume by enclosing polyhedron is a fundamental problem in visualization. In this paper we propose the first proof of the long-standing conjecture that the problem of finding an enclosing polyhedron with a minimal number of 2-facets is strongly NP-hard and provide a lower bound for that number.
Description:
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s).