Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

[HZ+00]  Illustrating Smooth Surfaces

Hertzmann:2000:ISS (In proceedings)
Author(s)Hertzmann A. and Zorin D.
Title« Illustrating Smooth Surfaces »
InProceedings of ACM SIGGRAPH 2000 (New Orleans, LA, July 23--28, 2000)
SeriesComputer Graphics Proceedings, Annual Conference Series
Editor(s)Judith R. Brown and Kurt Akeley
Page(s)517--526
Year2000
OrganizationACM SIGGRAPH
AddressNew York
URLhttp://mrl.nyu.edu/publications/illustrating-smooth/
Editor(s)Judith R. Brown and Kurt Akeley

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.

BibTeX code
@inproceedings{Hertzmann:2000:ISS,
  www =
         {http://mrl.nyu.edu/publications/illustrating-smooth/hertzmann-zorin.pdf},
  author = {Aaron Hertzmann and Denis Zorin},
  series = CGPACS,
  editor = {Judith R. Brown and Kurt Akeley},
  url = {http://mrl.nyu.edu/publications/illustrating-smooth/},
  optpublisher = {ACM Press},
  localfile = {papers/Hertzmann.2000.ISS.pdf},
  address = {New York},
  optmonth = aug,
  doi = {http://doi.acm.org/10.1145/344779.345074},
  organization = {ACM SIGGRAPH},
  citeseer = {http://citeseer.nj.nec.com/hertzmann00illustrating.html},
  booktitle = SIGGRAPH2000,
  optstatus = {OK},
  title = {{I}llustrating {S}mooth {S}urfaces},
  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.},
  pages = {517--526},
  year = {2000},
}

 Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

Submit a bug

This document was generated by bib2html 3.3.
Copyright © 1998-05 Stéphane GALLAND (under the GNU General Public License)

Valid HTML 4.01!Valid CSS!