Abstract
We present a new set of algorithms for line-art rendering of smooth surfaces. We introduce an efficient, deterministic algorithm for finding silhouettes based on geometric duality, and an algorithm for segmenting the silhouette curves into smooth parts with constant visibility. These methods can be used to find all silhouettes in real time in software. We present an automatic method for generating hatch marks in order to convey surface shape. We demonstrate these algorithms with a drawing style inspired by A Topological Picturebook by G. Francis.
Author supplied keywords
Cite
CITATION STYLE
Hertzmann, A., & Zorin, D. (2000). Illustrating smooth surfaces. In SIGGRAPH 2000 - Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques (pp. 517–526). Association for Computing Machinery, Inc. https://doi.org/10.1145/344779.345074
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
