Stipple Placement using Distance in a Weighted Graph
David Mould
Workshop on Computational Aesthetics, 2007, pp. 45--52.
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{Mould:2007:SPU,
author = {David Mould},
title = {Stipple Placement using Distance in a Weighted Graph},
booktitle = {Workshop on Computational Aesthetics},
pages = {45--52},
year = {2007},
}
Return to the search page.
graphbib: Powered by "bibsql" and "SQLite3."