کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
442158 692063 2009 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Halftoning with minimum spanning trees and its application to maze-like images
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر گرافیک کامپیوتری و طراحی به کمک کامپیوتر
پیش نمایش صفحه اول مقاله
Halftoning with minimum spanning trees and its application to maze-like images
چکیده انگلیسی

We propose a method for generating halftone images by using minimum spanning trees (MSTs). We generate a stippling from an input image by using centroidal Voronoi tessellation (CVT), and then connect all the points in the stippling with an MST. We derive a relationship of darkness between the input image and the MST halftone image by approximating CVT with the hexagonal lattice, and utilize it for correcting the brightness of the MST halftone images. We also propose methods for generating maze-like images on the basis of the MST halftone images. We embed user-specified solution paths in the MST halftone images in two ways. Experimental results show that the solution paths are successfully embedded and hidden in the maze-like images.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Graphics - Volume 33, Issue 5, October 2009, Pages 638–647
نویسندگان
, ,