Stipple Placement using Distance in a Weighted Graph

Mould, David

Stipple Placement using Distance in a Weighted Graph

Files

045-052.pdf (1.2 MB)

Date

2007

Authors

Mould, David

Publisher

The Eurographics Association

Abstract

We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights given by the local gradient magnitude of the input image. Then, a variant of Disjkstra s algorithm is used to place stipples: new stipples are placed along the frontier, which tends to be aligned with image edges. The resulting stipple distribution approximates a blue noise distribution, but emphasizes edges from the input image. We also show how irregular mosaics can be organized and the mosaic tiles shaped using the same underlying mechanism.

        @inproceedings{:10.2312/COMPAESTH/COMPAESTH07/045-052
,
booktitle = {Computational Aesthetics in Graphics, Visualization, and Imaging
},
editor = {Douglas W. Cunningham and Gary Meyer and Laszlo Neumann
},
title = {{Stipple Placement using Distance in a Weighted Graph
}},
author = {Mould, David
},
year = {2007
},
publisher = {The Eurographics Association
},
ISSN = {1816-0859
},
ISBN = {978-3-905673-43-2
},
DOI = {/10.2312/COMPAESTH/COMPAESTH07/045-052
}
}