Halftoning with minimum spanning trees and its application to maze-like images

Kohei Inoue, Kiichi Urahama

    Research output: Contribution to journalArticlepeer-review

    16 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)638-647
    Number of pages10
    JournalComputers and Graphics (Pergamon)
    Volume33
    Issue number5
    DOIs
    Publication statusPublished - Oct 2009

    All Science Journal Classification (ASJC) codes

    • General Engineering
    • Human-Computer Interaction
    • Computer Graphics and Computer-Aided Design

    Fingerprint

    Dive into the research topics of 'Halftoning with minimum spanning trees and its application to maze-like images'. Together they form a unique fingerprint.

    Cite this