Elsevier

Computers & Graphics

Volume 26, Issue 3, June 2002, Pages 449-462
Computers & Graphics

Technical Section
Multiresolution modeling of arbitrary polygonal surfaces: a characterization

https://doi.org/10.1016/S0097-8493(02)00088-2Get rights and content

Abstract

Recent technological advances have favored the apparition of highly detailed objects and, consequently, their availability for a wide diversity of applications. Normally, these objects are represented by means of complex polygonal surfaces formed by hundreds of thousands of polygons, which produce important increases in the costs of storage, transmission and visualization. Multiresolution modeling, which allows an object to be represented by means of a set of approximations, each with a different number of polygons, has been successfully presented as a solution for the efficient manipulation of this type of objects. Although the first references to multiresolution modeling appeared more than 20 years ago, most of the multiresolution schemes specifically applied to polygonal surfaces have been proposed recently. This paper, after a brief review of multiresolution modeling, presents a characterization of the most interesting multiresolution schemes for arbitrary polygonal surfaces. The objective is to make the similarities and differences between them easily visible. With this aim, a series of characteristics is enumerated. These characteristics have commonly been used to define the multiresolution schemes and they are arranged together depending on whether they refer to the applications, to the input data or to the internal operation.

Introduction

Technological advances have provided extensive data bases of highly detailed objects. For example, the acquisition of data via satellite, laser scanners or medical image devices are methods that, thanks to their high precision, allow for the creation of large three-dimensional (3D) data sets. In turn, there are many applications that take advantage of the availability of this type of objects. Fields such as cartography, computer-aided design, computer graphics, computer vision, analysis of finite elements and scientific visualization, apply them to terrain representation, virtual reality, flight simulators, analysis of structures, etc. Normally, these objects are represented by means of polygonal surfaces [1]. Nowadays, this type of representation is the most frequently used in the field of interactive computer graphics. This is due to various reasons such as the high availability of polygonal surface data, the fact that they are used by most visualization software, and that graphic systems accelerate the visualization of polygons. However, the costs of visualization, storage or transmission of these surfaces increase considerably when they are formed by tens of millions of polygons.

Multiresolution modeling [2] has been successfully presented as a solution to the problem of efficient manipulation of highly detailed polygonal surfaces. It consists of representing an object by means of multiple approximations or levels of detail (LoDs) where each approximation or LoD represents the original object using a different number of polygons (see Fig. 1). The development of the multiresolution modeling was probably stimulated in the main by the need to achieve the interactive visualization of these objects. Of course, other techniques such as occlusion culling or image-based rendering have been proposed as satisfactory solutions to this problem. However, other applications of multiresolution modeling have gained equal importance as this one and have notably contributed to its development. We specifically refer to the progressive transmission of 3D data sets through a communication line and to the storage in a compressed form.

In this paper, we present a characterization of multiresolution schemes. In general, the idea of multiresolution modeling is not new. The first studies appeared 20 years ago [3] and they were mainly applied to terrain meshes in flight simulators. However, multiresolution modeling of arbitrary polygonal surfaces is relatively recent and this is the focal point of this study. Multiresolution schemes presented in the literature are diverse and the aim of this paper is to bring together the most interesting ones and, by means of a series of characteristics commonly used in multiresolution modeling, to make the existing similarities and differences between them visible in a simple way. These characteristics are classified into three groups:

  • Input data: They refer to the input data of a multiresolution scheme, such as the type of polygonal surface that it can manage.

  • Application: They refer to the suitability of a multiresolution scheme for application to interactive visualization, progressive transmission or geometry compression.

  • Operation: They refer to the internal operation of the multiresolution scheme, such as the way data is stored or retrieved, and they inform on special functionalities.


Some valuable studies on multiresolution modeling have been presented in the literature. Puppo and Scopigno [4] present a study beginning with the origins of multiresolution modeling that includes geometry simplification, multiresolution modeling and even commercial applications. Garland [5] presents a review of multiresolution modeling taking the initial problem—the simplification of polygonal surfaces—as a starting point, and finally presenting a classification and explanation of several basic multiresolution representation schemes. Although both studies are very thorough, they do not show the differences between multiresolution schemes, which is the aim of this paper.

Section snippets

Multiresolution modeling

Multiresolution modeling consists of representing an object by means of a set of approximations of several levels of detail and allows any of them to be recovered on demand. The first multiresolution schemes managed a relatively small number of LoDs [6] (normally, between 5 and 10) and they were developed with the main objective of accelerating the visualization of the scene. Later, multiresolution schemes that manage a continuous range of approximations appeared. They allow the level of detail

Discrete multiresolution modeling

The simplest way to create a multiresolution representation is to generate a set of independent approximations where each one represents the original object with a different level of detail. If we can obtain these approximations, we have a discrete multiresolution representation. This technique began to be used with the main aim of increasing the performance of the graphic system and this was accomplished in applications such as walkthroughs in virtual environments as proposed by Funkhouser and

Continuous multiresolution modeling

Continuous multiresolution modeling has come about to solve the problems presented by discrete multiresolution modeling. A continuous multiresolution representation provides a wide range (virtually a continuous range [4]) of different approximations that represent the original object. The iterative application of a simplification method, starting from the original data set, M0, produces a sequence of approximations M1,M2,…,Mn−1, where Mn−1 is the approximation with the least detail. A

Characterization

Characterization has been carried out for the multiresolution schemes for arbitrary polygonal surfaces shown in Table 1. The criteria used in this characterization are classified depending on whether they refer to the applications, to the input data or to the internal operation.

Conclusions

Multiresolution modeling for arbitrary poligonal surface meshes has been developed very rapidly during the last 6 years with the aim of efficiently managing highly detailed objects. Each multiresolution scheme presented in the literature has a set of characteristics that make it different from the others. In this paper, we summarize the characteristics commonly used to define the multiresolution schemes and we classify them depending on whether they refer to the applications, to the input data

Acknowledgements

This research work has been supported by grants TIC1999-0510-C02-02 and TIC2000-1131 (CICYT, Ministerio de Educación y Ciencia, Spain). We would like to thank Michael Garland for making his code available for us; Cyberware, Inc. and the Standford Computer Graphics Laboratory for providing the 3D data sets; and the reviewers for their insightful comments which led to several improvements in the presentation of this paper.

References (77)

  • P. Cignoni et al.

    A comparison of mesh simplification algorithms

    Computers & Graphics

    (1998)
  • J. Huerta et al.

    Multiresolution modeling using binary space partitioning trees

    Computer Networks & ISDN Systems

    (1998)
  • E. Puppo

    Variable resolution triangulations

    Computational Geometry

    (1998)
  • H. Hoppe

    Efficient implementation of progressive meshes

    Computer & Graphics

    (1998)
  • J.D. Foley et al.

    Computer graphics. Principles and practice

    (1990)
  • Heckbert PS, Garland M. Multiresolution modeling for fast rendering. In: Proceedings of Graphics Interface ’94, 1994....
  • J.H. Clark

    Hierarchical geometric models for visible surface algorithms

    CACM

    (1976)
  • Puppo E, Scopigno R. Simplification, LOD and multiresolution—principles and applications. Tutorial Notes of...
  • Garland M. Multiresolution modeling: survey & future opportunities. State of the Art Reports of EUROGRAPHICS ’99, 1999....
  • Funkhouser T, Séquin C, Teller S. Management of large amounts of data in interactive building walkthroughs. In:...
  • Heckbert PS, Garland M. Survey of polygonal surface simplification algorithms. Multiresolution Surface Modeling Course...
  • Erikson C. Polygonal simplification: an overview. Technical report TR96-016, Department of Computer Science, UNC-Chapel...
  • A. Ciampalini et al.

    Multiresolution decimation based on global error

    The Visual Computer

    (1997)
  • Lindstrom P, Turk G. Fast and memory efficient polygonal simplification. In: Proceedings of IEEE Visualization 98,...
  • P. Lindstrom et al.

    Evaluation of memoryless simplification

    IEEE Transactions on Visualization and Computer Graphics

    (1999)
  • P. Cignoni et al.

    Metromeasuring error on simplified surfaces

    Computer Graphics Forum

    (1998)
  • Huerta J. Aproximación multirresolución de los árboles binarios de particionamiento espacial: aplicación a la...
  • Hoppe H. Smooth view-dependent level-of-detail control and its application to terrain rendering. In: Proceedings of...
  • L. De Floriani et al.

    Multiresolution models for topographic surface description

    The Visual Computer

    (1996)
  • Fowler RJ, Little JJ. Automatic extraction of irregular network digital terrain models. Proceedings of SIGGRAPH ’79,...
  • J. Lee

    Analysis of visibility sites on topographic surfaces

    Geographic Information Systems

    (1991)
  • Taylor DD, Barret WA. An algorithm for continuous resolution polygonalizations of a discrete surface. In: Proceedings...
  • M. Lounsbery et al.

    Multiresolution analysis for surfaces of arbitrary topological type

    ACM Transactions on Graphics

    (1997)
  • Lindstrom P, Koller D, Ribarsky W, Hodges LF, Faust N, Turner GA. Real-time, continuous level of detail rendering of...
  • P. Cignoni et al.

    Representation and visualization of terrain surfaces at variable resolution

    The Visual Computer

    (1997)
  • Scarlatos LL. A refined triangulation hierarchy for multiples level of terrain detail. In: Proceedings of Image V...
  • Duchaineau M, Wolinsky M, Sigeti D, Miller M, Aldrich C, Mineev-Weinstein, ROAMing terrain: real-time optimally...
  • Andujar C. Octree-based simplifcation of polyhedral solids. Ph.D. thesis, Departament LSI, Universitat Politécnica de...
  • Funkhouser T, Séquin C. Adaptive display algorithm for interactive frames rates during visualization of complex virtual...
  • Maciel P, Shirley P. Visual navigation of large environments using textured clusters. In: Symposium on Interactive 3D...
  • M. Woo et al.

    OpenGL programming guide

    (1997)
  • J. Wernecke

    The inventor mentor: programming object-oriented 3D graphics with open inventor, Release 2

    (1993)
  • Rohlf J, Helman J. IRIS Performer: A high performance multiprocessing toolkit for real-time 3D graphics. In:...
  • Bell G, Parisi A, Pesce M. The virtual reality modeling language: Version 1.0 specification,...
  • M. Reddy

    A survey of level of detail support in current virtual reality solutions

    Virtual Reality: Research, Development and Applications

    (1995)
  • Puppo E. Variable resolution terrain surfaces. In: Proceedings of Eighth Canadian Conference on Computational Geometry,...
  • L. De Floriani et al.

    A formal approach to multiresolution hypersurface modeling

  • R. Klein et al.

    Generation of multiresolution models from CAD data for real time rendering, Theory and practice of geometric modeling

    (1997)
  • Cited by (33)

    • A morphologically preserved multi-resolution TIN surface modeling and visualization method for virtual globes

      2017, ISPRS Journal of Photogrammetry and Remote Sensing
      Citation Excerpt :

      Another common approach to multi-resolution terrain modeling and visualization is the use of TIN-based methods, which are theoretically capable of producing a terrain representation of minimal complexity. Early examples of TIN-based methods can be found in the works of Hoppe (1997), Pajarola et al. (2002) and Ribelles et al. (2002). However, these methods were not all successfully applied to spherical terrain rendering in virtual globes, due to the high cost of maintaining the mesh connectivity, hierarchies, and dependencies.

    • View-dependent pruning for real-time rendering of trees

      2011, Computers and Graphics (Pergamon)
      Citation Excerpt :

      This is specially true in dense forests, where the massive amount of primitives can easily overwhelm the most advanced rendering system available. Multiresolution level of detail—LoD—models [30] are well-known methods for altering the polygonal complexity of objects in order to improve performance in highly detailed meshes. The basic idea behind these methods is that highly detailed models do not always need to be represented at full detail.

    • Optimizing the management of continuous level of detail models on GPU

      2008, Computers and Graphics (Pergamon)
      Citation Excerpt :

      It is included in Microsoft Corporation's graphics library DirectX since the 5.0 version. A comprehensive characterization of multiresolution models can be found in [2]. Advances have been made in the use of new graphic primitives which minimize the data transfer between the CPU and the GPU by means of a wise use of the connectivity information provided by a polygonal mesh.

    • Multiresolution foliage rendering

      2020, CEUR Workshop Proceedings
    View all citing articles on Scopus
    View full text