Generalized view-dependent simplification

Jihad El-Sana, Amitabh Varshney

Research output: Contribution to journalConference articlepeer-review

119 Scopus citations


We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preprocessing the input dataset into a binary tree, the view-dependence tree of general vertex-pair collapses. A subset of the Delaunay edges is used to limit the number of vertex pairs considered for topology simplification. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the view-dependence tree in an implicit fashion. We have observed that this not only reduces the space requirements by a factor of two, it also highly localizes the memory accesses at run time. The view-dependence tree is used at run time to generate the triangles for display. We also propose a cubic-spline-based distance metric that can be used to unify the geometry and topology simplifications by considering the vertex positions and normals in an integrated manner.

Original languageEnglish
Pages (from-to)83-94
Number of pages12
JournalComputer Graphics Forum
Issue number3
StatePublished - 1 Jan 1999
Externally publishedYes
EventProceedings of the 1999 20th Annual Conference of the European Association for Computer Graphics, EUROGRAPHICS '99 - Milano, Italy
Duration: 7 Sep 199911 Sep 1999

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Generalized view-dependent simplification'. Together they form a unique fingerprint.

Cite this