@article{Isenberg:2002:SSA,
www = {http://www.eg.org/EG/CGF/volume21/issue3/abstracts/CGF584.HTML},
number = {3},
month = sep,
optnote = {},
author = {Tobias Isenberg and Nick Halper and Thomas Strothotte},
optkey = {},
optannote = {},
editor = {George Drettakis and Hans-Peter Seidel},
url = {http://isgwww.cs.uni-magdeburg.de/~nick/stylizedsilhouettes/},
address = {Oxford, UK},
localfile = {papers/Isenberg.2002.SSA.pdf},
publisher = {Blackwell Publishers},
doi = {http://dx.doi.org/10.1111/1467-8659.00584},
organization = {The Eurographics Association},
journal = EUROGRAPHICS2002,
citeseer = {http://citeseer.nj.nec.com/isenberg02stylizing.html},
volume = {21},
booktitle = {Proceedings of Eurographics 2002 (Saarbr{\"u}cken, Germany, sep
2002)},
optstatus = {doi},
title = {{S}tylizing {S}ilhouettes at {I}nteractive {R}ates: {F}rom
{S}ilhouette {E}dges to {S}ilhouette {S}trokes},
abstract = {A way to create effective stylized line drawings is to draw
strokes that start and stop at visible portions along the
silhouette of an object to be portrayed. In computer graphics to
date, algorithms to extract silhouette edges are many, although
putting these edges into a form such that stylized strokes may be
applied to them has not been greatly covered, so that existing
methods are either time-consuming or presented vaguely. In this
paper, we introduce an algorithm that takes a set of silhouette
edges originating from polygonal meshes and efficiently computes
the visible parts of the edges before connecting them to form long
smooth silhouette strokes to which stylization algorithms may be
effectively applied. Features of our algorithm that gain
efficiency and accuracy over existing methods is that we directly
exploit the analytic connectivity information of the mesh in
combination with the available z-buffer information during
rendering, and filter artifacts in connected edges during the
process to improve the visual quality of strokes after
stylization.},
year = {2002},
pages = {249--258},
}
|