Stipple Placement using Distance in a Weighted Graph

Simple item page
dc.contributor.authorMould, Daviden_US
dc.contributor.editorDouglas W. Cunningham and Gary Meyer and Laszlo Neumannen_US
dc.date.accessioned2013-10-22T07:39:39Z
dc.date.available2013-10-22T07:39:39Z
dc.date.issued2007en_US
dc.description.abstractWe 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.en_US
dc.description.seriesinformationComputational Aesthetics in Graphics, Visualization, and Imagingen_US
dc.identifier.isbn978-3-905673-43-2en_US
dc.identifier.issn1816-0859en_US
dc.identifier.urihttps://doi.org/10.2312/COMPAESTH/COMPAESTH07/045-052en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Line and Curve Generationen_US
dc.titleStipple Placement using Distance in a Weighted Graphen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
045-052.pdf
Size:
1.2 MB
Format:
Adobe Portable Document Format
Download
Collections
CompAesth 07: Workshop on Computational Aesthetics