Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

[EC+90]  Hidden Curve Removal for Free Form Surfaces

Elber:1990:HCR (Article)
Author(s)Elber G. and Cohen E.
Title« Hidden Curve Removal for Free Form Surfaces »
JournalACM SIGGRAPH Computer Graphics, Proceedings of ACM SIGGRAPH 90 (Dallas, TX, August 6--10, 1990)
Volume24
Number3
Page(s)95--104
Year1990
AddressNew York
Editor(s)Forest Baskett

Abstract
This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algo- rithm produces higher quality results than polygon based algorithms, as most of the output set has an exact represen- tation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data.

BibTeX code
@article{Elber:1990:HCR,
  optcitations = {Appel:1967:TNQ,Kamada:1987:AET},
  number = {3},
  month = aug,
  author = {Gershon Elber and Elaine Cohen},
  optkey = {},
  series = CGPACS,
  editor = {Forest Baskett},
  localfile = {papers/Elber.1990.HCR.pdf},
  address = {New York},
  optkeywords = {hiddent curve removal, curve-curve intersection, visibility
                 propagation},
  doi = {http://doi.acm.org/10.1145/97879.97890},
  organization = {ACM SIGGRAPH},
  journal = SIGGRAPH90,
  optconference = {held in Dallas, Texas; 6-10 August 1990},
  volume = {24},
  title = {{H}idden {C}urve {R}emoval for {F}ree {F}orm {S}urfaces},
  abstract = {This paper describes a hidden curve algorithm specifically
              designed for sculptured surfaces. A technique is described to
              extract the visible curves for a given scene without the need to
              approximate the surface by polygons. This algo- rithm produces
              higher quality results than polygon based algorithms, as most of
              the output set has an exact represen- tation. Surface coherence is
              used to speed up the process. Although designed for sculptured
              surfaces, this algorithm is also suitable for polygonal data.},
  year = {1990},
  pages = {95--104},
}

 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!