Skip to main content

Multi-resolution 3D approximations for rendering complex scenes

  • Conference paper

Part of the book series: IFIP Series on Computer Graphics ((IFIP SER.COMP.))

Abstract

We present a simple, effective, and efficient technique for approximating arbitrary polyhedra. It is based on triangulation and vertex-clustering, and produces a series of 3D approximations (also called “levels of detail”) that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices. The simplification is more efficient than competing techniques because it does not require building and maintaining a topological adjacency graph. Furthermore, it is better suited for mechanical CAD models which often exhibit patterns of small features, because it automatically groups and simplifies features that are geometrically close, but need not be topologically close or even part of a single connected component Using a lower level of detail when displaying small, distant, or background objects improves graphic performance without a significant loss of perceptual information, and thus enables realtime inspection of complex scenes or a convenient environment for animation or walkthrough preview.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Airey, J., Rohlf, J., and Brooks, F. Towards image realism with interactive update rates in complex virtual building environments. ACM Proc. Symposium on Interactive 3D Graphics, 24(2):41–50, 1990.

    Google Scholar 

  • Clark, J. Hierarchical geometric models for visible surface algorithms. Communications of the ACM, 19(10):547–554, October 1976.

    Article  MATH  Google Scholar 

  • Crow, F. A more flexible image generation environment. Computer Graphics, 16(3):9–18, 1982.

    Article  Google Scholar 

  • DeHaemer and Zyda, M. Simplification of objects rendered by polygonal approximations. Computers and Graphics, 15(2): 175–184, 1991.

    Article  Google Scholar 

  • DeRose, T., Hoppe, H., McDonald, J., and Stuetzle, W. Fitting of surfaces to scattered data. In J. Warren, editor, SPIE Proc. Curves and Surfaces in Computer Vision and Graphics III, 1830:212–220, November 16–18 1992.

    Google Scholar 

  • Edelsbrunner, H., Tan, S.T., and Waupotitsch, A. A polynomial time algorithm for the mini-max angle triangulation. 6th ACM Symp. on Computational Geometry, 44–52, 1990.

    Google Scholar 

  • Garlick, B.J., Baum, D.R., and Winget, J.M. Interactive viewing of large geometric databases using multiprocessor graphics workstations. SIGGRAPH Course Notes, 28:239–245, 1990.

    Google Scholar 

  • Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W. Surface reconstruction from unorganized points. Computer Graphics, 26(2):71–78, July 1992.

    Article  Google Scholar 

  • Kalvin, A., Cutting, C., Haddad, B., and Noz, M. Constructing topologically connected surfaces for the comprehensive analysis of 3D medical structures. SPIE Image Processing, 1445:247–258, 1991.

    Google Scholar 

  • Kaul, A. and Rossignac, J. Solid-Interpolating Deformations: Constructions and Animation of PIPs. Computers and Graphics (Best Paper Award at Eurographics’91), 16(1):107–115, 1992.

    Google Scholar 

  • Kim, Y.S. Convex decomposition and solid geometric modeling, PhD thesis. Dept, of Mechanical Engineering, Stanford University, 1990.

    Google Scholar 

  • McMaster, R.B. Automated Line Generation. Cartographica, 24(2):74–111, 1987.

    Article  MathSciNet  Google Scholar 

  • Rockwood, A., Heaton, K., and Davis, T. Real-time Rendering of Trimmed Surfaces. Computer Graphics, 23(3):107–116, 1989.

    Article  Google Scholar 

  • Ronfard, R. and Rossignac, J. Flooding: Efficient triangulation of multiply connected polygons. IBM Research. In preparation. 1993.

    Google Scholar 

  • Scarlatos, L. and Pavlidis, T. Hierarchical triagulation using cartographic coherence. CVGIP: Graphical Models and Image Processing, 54(2):147–161, 1992.

    Article  Google Scholar 

  • Schmitt, F., Barsky, B., and Du, W. An adaptive subdivision method for surface- fitting from sampled data. Computer Graphics, 20(4):179–188, 1996.

    Article  Google Scholar 

  • Schroeder, W., Zarge, J., and Lorensen, W. Decimation of triangle meshes. Computer Graphics, 26(2):65–70, July 1992.

    Article  Google Scholar 

  • Teller, S.J. and Séquin, C.H. Visibility Preprocessing for interactive walkthroughs. Computer Graphics, 25(4):61–69, July 1991.

    Article  Google Scholar 

  • Turk, G. Re-tiling polygonal surfaces. Computer Graphics, 26(2):55–64, July 1992.

    Article  Google Scholar 

  • Williams, L. Pyramidal parametrics. Computer Graphics, 17(3):1–10, 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rossignac, J., Borrel, P. (1993). Multi-resolution 3D approximations for rendering complex scenes. In: Falcidieno, B., Kunii, T.L. (eds) Modeling in Computer Graphics. IFIP Series on Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78114-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78114-8_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-78116-2

  • Online ISBN: 978-3-642-78114-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics