کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9655196 684007 2005 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Plane digitization and related combinatorial problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Plane digitization and related combinatorial problems
چکیده انگلیسی
In this paper we propose a simple scheme for obtaining plane digitizations. We study digital plane periodicity and consider various issues related to two-dimensional (2D) Sturmian words. Concepts and results, already known for one-dimensional words, are extended to 2D words. In particular, we address a conjecture by Maurice Nivat for the case of digital 2D rays. Our approach is based in part on extending periodicity studies in theory of words to 2D words based on (Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 440-452; Proceedings of the 33rd IEEE Symposium on Foundations in Computer Science, 1992, pp. 247-250).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 147, Issues 2–3, 15 April 2005, Pages 169-186
نویسندگان
, ,