Stipple Placement using Distance in a Weighted Graph
Conference Paper
Award(s):
Best technical paper
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.
BibTeX
@inproceedings{Mould:2007:SPU:2381255.2381262,
author = {Mould, David},
title = {Stipple Placement Using Distance in a Weighted Graph},
booktitle = {Proceedings of the Third Eurographics Conference on Computational Aesthetics in Graphics, Visualization and Imaging},
series = {Computational Aesthetics'07},
year = {2007},
isbn = {978-3-905673-43-2},
location = {Alberta, Canada},
pages = {45--52},
numpages = {8},
url = {http://dx.doi.org/10.2312/COMPAESTH/COMPAESTH07/045-052},
doi = {10.2312/COMPAESTH/COMPAESTH07/045-052},
acmid = {2381262},
publisher = {Eurographics Association},
address = {Aire-la-Ville, Switzerland, Switzerland},
}