@article{Lee:1981:SRV,
opteditor = {},
number = {3},
month = aug,
optnote = {},
author = {D. T. Lee},
optkey = {},
series = CGPACS,
optannote = {},
address = {New York},
localfile = {papers/Lee.1981.SRV.pdf},
publisher = {ACM Press},
doi = {http://doi.acm.org/10.1145/965161.806787},
organization = {ACM SIGGRAPH},
journal = SIGGRAPH81,
volume = {15},
optcrossref = {},
title = {{S}hading of {R}egions on {V}ector {D}isplay {D}evises},
abstract = {Given an arbitrary simple polygon with N vertices we present an
algorithm for shading the interior of the polygon with a set of
parallel lines where the slope and the distance between lines are
prespecified. If the number of shading line segments is M, the
algorithm described in the paper runs in 0(N log N + M) time. The
algorithm is generalizable to shade any region or regions of an
arbitrary planar subdivision.},
year = {1981},
pages = {3744},
}
