Graph‐based Black and White Stylization

Abstract Stippling is an art style forming images from large numbers of small dots. Computer graphics practitioners have proposed numerous algorithms for stippling and stippling variants over the years. In this paper, we propose a black and white image stylization technique in which the image is formed from heterogeneous black and white vector marks, with stipples and larger regions represented by polygons. Our algorithm applies two passes of stippling: first, we apply stippling to an importance map of the input image; then, using the stipples from the first pass as nodes in a planar graph, we create a binary stippling by labeling each graph node as either black or white using error diffusion. A connected component analysis of the resulting labeling, followed by vectorization of the components, yields a high‐quality black and white representation of the original image. Isolated nodes, sharing a color with none of their neighbors, are akin to stipples; larger groups are polygons. We provide quantitative and qualitative comparisons with previous work on stippling and black and white rendering.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-04-14
DOI
https://doi.org/10.1111/cgf.70364
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph‐based Black and White Stylization

David Mould, Ali Sattari Javid, Jimmy Lord
Computer Graphics Forum
Computer Graphics and Visualization Techniques
article

Graph‐based Black and White Stylization

David Mould, Ali Sattari Javid, Jimmy Lord
article en

Abstract

Abstract Stippling is an art style forming images from large numbers of small dots. Computer graphics practitioners have proposed numerous algorithms for stippling and stippling variants over the years. In this paper, we propose a black and white image stylization technique in which the image is formed from heterogeneous black and white vector marks, with stipples and larger regions represented by polygons. Our algorithm applies two passes of stippling: first, we apply stippling to an importance map of the input image; then, using the stipples from the first pass as nodes in a planar graph, we create a binary stippling by labeling each graph node as either black or white using error diffusion. A connected component analysis of the resulting labeling, followed by vectorization of the components, yields a high‐quality black and white representation of the original image. Isolated nodes, sharing a color with none of their neighbors, are akin to stipples; larger groups are polygons. We provide quantitative and qualitative comparisons with previous work on stippling and black and white rendering.

Computer Graphics Forum
Carleton University (CA)
Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 18%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.