Discrete Volume Polyhedrization is Strongly NP-Hard

Brimkov, Valentin

dc.contributor.author	Brimkov, Valentin	en
dc.date.accessioned	2008-08-21T01:56:55Z	en
dc.date.available	2008-08-21T01:56:55Z	en
dc.date.issued	2006	en
dc.identifier.citation	Communication and Information Technology Research Technical Report 179, (2006)	en
dc.identifier.issn	1178-3566	en
dc.identifier.uri	http://hdl.handle.net/2292/2790	en
dc.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).	en
dc.description.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.	en
dc.publisher	CITR, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	Communication and Information Technology Research (CITR) Technical Report Series	en
dc.rights	Copyright CITR, The University of Auckland. 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 under terms that include this permission. All other rights are reserved by the author(s).	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://citr.auckland.ac.nz/techreports/2006/CITR-TR-179.pdf	en
dc.title	Discrete Volume Polyhedrization is Strongly NP-Hard	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en