Advertisement

View-Dependent Topology Simplification

  • Jihad El-Sana
  • Amitabh Varshney
Part of the Eurographics book series (EUROGRAPH)

Abstract

We propose a technique for performing view-dependent sim­plifications for level-of-detail-based renderings of complex models. Our method is based on exploiting frame-to-frame coherence and is tolerant of various commonly found degeneracies in real-life polygonal models. The algorithm proceeds by preprocessing the input dataset into a binary tree of vertex collapses. This tree is used at run time to generate the triangles for display. Dependencies to avoid mesh foldovers in manifold regions of the input object are stored in the tree in an implicit fashion. This obviates the need for any extra storage for dependency pointers and suggests a potential for application to external memory prefetching algo­rithms. We also propose a distance metric that can be used to unify the geometry and genus simplifications with the view-dependent parameters such as viewpoint, view-frustum, and local illumination.

Keywords

Directed Acyclic Graph Genus Simplification Polygonal Mesh Vertex Pair Topology Simplification 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    E.-C. Chang and C. Yap. A wavelet approach to foveating images. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97),pages 397–399, New York, June4–6 1997. ACM Press.Google Scholar
  2. 2.
    P. Cignoni, C. Montani, and R. Scopigno. A comparison of mesh simplification algorithms. Computers & Graphics,22(1):37–54, February 1998. ISSN 0097–8493.CrossRefGoogle Scholar
  3. 3.
    J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. P. Brooks, Jr., and W. V. Wright. Simplification envelopes. In Proceedings of SIGGRAPH ‘86, pages 119–128. ACM SIGGRAPH, ACM Press, 1996.Google Scholar
  4. 4.
    L. De Floriani, P. Magillo, and E. Puppo. Efficient implementation of multi-triangulation. In Proceedings Visualization ‘88, pages 43–50, 1998.Google Scholar
  5. 5.
    J. El-Sana and A. Varshney. Topology simplification for polygonal virtual environments. IEEE Transactions on Visualization and Computer Graphics, 4, No. 2: 133–144, 1998.CrossRefGoogle Scholar
  6. 6.
    M. Garland and P. Heckbert. Surface simplification using quadric error metrics. In Proceedings of SIGGRAPH ‘87 (Los Angeles, CA), pages 209–216. ACM SIG-GRAPH, ACM Press, August 1997.Google Scholar
  7. 7.
    A. Gueziec, F. Lazarus, G. Taubin, and W. Horn. Surface partitions for progressive transmission and display, and dynamic simplification of polygonal surfaces. In Proceedings VRML 98, Monterey, California, February 16–19, pages 25–32, 1998.Google Scholar
  8. 8.
    T. He, L. Hong, A. Varshney, and S. Wang. Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics, 2 (2): 171–184, 1996.CrossRefGoogle Scholar
  9. 9.
    H. Hoppe. Progressive meshes. In Proceedings of SIGGRAPH ‘86 (New Orleans, LA, August 4–9, 1996), pages 99–108. ACM SIGGRAPH, ACM Press, 1996.Google Scholar
  10. 10.
    H. Hoppe. View-dependent refinement of progressive meshes. In Proceedings of SIGGRAPH ‘87, pages 189–197. ACM SIGGRAPH, ACM Press, 1997.CrossRefGoogle Scholar
  11. 11.
    R. Klein, A. Schilling, and W. Straßer. Illumination dependent refinement of multiresolution meshes. In Computer Graphics International, June 1998.Google Scholar
  12. 12.
    P. Lindstrom and G. Turk. Fast and memory efficient polygonal simplification. In Proceedings Visualization ‘88, pages 279–286, 1998.Google Scholar
  13. 13.
    D. Luebke and C. Erikson. View-dependent simplification of arbitrary polygonal environments. In Proceedings of SIGGRAPH ‘87 (Los Angeles, CA), pages 198–208. ACM SIGGRAPH, ACM Press, August 1997.Google Scholar
  14. 14.
    D. Marshall, A. Campbell, and D. Fussell. Model simplification using directional clustering. In Visual Proceedings, page 174. ACM/SIGGRAPH Press, 1997.Google Scholar
  15. 15.
    J. Popovié and H. Hoppe. Progressive simplicial complexes. In Proceedings of SIGGRAPH ‘87, pages 217–224. ACM SIGGRAPH, ACM Press, August 1997.CrossRefGoogle Scholar
  16. 16.
    J. Rossignac and P. Borrel. Multi-resolution 3D approximations for rendering. In Modeling in Computer Graphics, pages 455–465. Springer-Verlag, June-July 1993.CrossRefGoogle Scholar
  17. 17.
    A. Schilling and R. Klein. Texture-dependent refinement for multiresolution models. In Computer Graphics International, June 1998.Google Scholar
  18. 18.
    W. Schroeder. A topology modifying progressive decimation algorithm. In IEEE Visualization ‘87 Proceedings, pages 205–212. ACM/SIGGRAPH Press, 1997.Google Scholar
  19. 19.
    J. Xia, J. El-Sana, and A. Varshney. Adaptive real-time level-of-detail-based rendering for polygonal models. IEEE Transactions on Visualization and Computer Graphics, pages 171–183, June 1997.Google Scholar

Copyright information

© Springer-Verlag/Wien 1999

Authors and Affiliations

  • Jihad El-Sana
    • 1
  • Amitabh Varshney
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations