کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
421330 684196 2009 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Minimum decomposition of a digital surface into digital plane segments is NP-hard
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Minimum decomposition of a digital surface into digital plane segments is NP-hard
چکیده انگلیسی

This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPSs for short). We prove that the decision problem (does there exist a decomposition with less than λλ DPSs?) is NP-complete, and thus that the optimization problem (finding the minimum number of DPSs) is NP-hard. The proof is based on a polynomial reduction of any instance of the well-known 3-SAT problem to an instance of the digital surface decomposition problem. A geometric model for the 3-SAT problem is proposed.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 157, Issue 3, 6 February 2009, Pages 558–570
نویسندگان
, ,