Overview   Tree   Index 
NPR Literature
PREV  NEXT FRAMES  NO FRAME 

[Lue01]  A Developer's Survey of Polygonal Simplification Algorithms

Luebke:2001:DSP (Article)
Author(s)Luebke D.
Title« A Developer's Survey of Polygonal Simplification Algorithms »
JournalIEEE Computer Graphics and Applications
Volume21
Number3
Page(s)24--35
Year2001

Abstract
Polygonal simplification, a.k.a. level of detail, is an important tool for anyone doing interactive rendering, but how is a developer to choose among the dozens of published algorithms? This article surveys the field from a developer's point of view, attempting to identify the issues in picking an algorithm, relate the strengths and weaknesses of different approaches, and describe a number of published algorithms as examples.

BibTeX code
@article{Luebke:2001:DSP,
  number = {3},
  optnote = {},
  author = {David P. Luebke},
  optkey = {},
  optannote = {},
  localfile = {papers/Luebke.2001.DSP.pdf},
  optmonth = {},
  journal = j-IEEE-CGA,
  doi = {http://dx.doi.org/10.1109/38.920624},
  citeseer = {http://citeseer.nj.nec.com/luebke01developers.html},
  volume = {21},
  optstatus = {doi},
  abstract = {Polygonal simplification, a.k.a. level of detail, is an important
              tool for anyone doing interactive rendering, but how is a
              developer to choose among the dozens of published algorithms? This
              article surveys the field from a developer's point of view,
              attempting to identify the issues in picking an algorithm, relate
              the strengths and weaknesses of different approaches, and describe
              a number of published algorithms as examples.},
  title = {{A} {D}eveloper's {S}urvey of {P}olygonal {S}implification
           {A}lgorithms},
  year = {2001},
  pages = {24--35},
}

 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!