View-Dependent Topology Simplification

Jihad El-Sana, Amitabh Varshney

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 GB
Title of host publicationProceedings of the 5th Eurographics Workshop on Virtual Environments, EGVE 1999, Vienna, Austria, May 31 - June 1, 1999
EditorsMichael Gervautz, Dieter Schmalstieg, Axel Hildebrand
Number of pages12
StatePublished - 1999

Publication series



Dive into the research topics of 'View-Dependent Topology Simplification'. Together they form a unique fingerprint.

Cite this