A fast algorithm for selective refinement of terrain meshes

https://doi.org/10.1016/S0169-7552(97)00074-3Get rights and content

Abstract

An efficient way to render terrain data is to display an approximating surface whose resolution has been enhanced in areas of interest. We present a new reduced expansion algorithm which extracts such a selectively-refined mesh faster than our previous minimal surface algorithm. A mesh can be generated from the output of any surface approximation process which can be viewed as a set of refinement operations acting on a base triangulation. We prove that our new algorithm generates a complete, although not necessarily minimal, surface which will satisfy any given resolution criteria and which may, in addition, satisfy the Delaunay triangulation criterion.

References (13)

  • P.J.C. Brown

    Selective mesh refinement for interactive terrain rendering

  • P. Cignoni et al.

    Representation and visualization of terrain surfaces at variable resolution

  • M.A. Cosman et al.

    A new visual system to support advanced requirements

  • M. de Berg et al.

    On levels of detail in terrains

    M. de Berg et al.
  • L. De Floriani et al.

    Hierarchical triangulation for multiresolution surface description

    ACM Trans. Graphics

    (1995)
  • D.H. Douglas

    Experiments to locate ridges and channels to create a new type of digital elevation model

    Cartographica

    (1986)
There are more references available in the full text version of this article.

Cited by (2)

View full text