ROAMing terrain: Real-time Optimally Adapting Meshes

Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and ground-based aircraft testing using synthetic sensor simulation. On current graphics hardware, the problem is to maintain dynamic, view-dependent triangle meshes and texture maps that produce good images at the required frame rate. We present an algorithm for constructing triangle meshes that optimizes flexible view-dependent error metrics, produces guaranteed error bounds, achieves specified triangle counts directly and uses frame-to-frame coherence to operate at high frame rates for thousands of triangles per frame. Our method, dubbed Real-time Optimally Adapting Meshes (ROAM), uses two priority queues to drive split and merge operations that maintain continuous triangulations built from pre-processed bintree triangles. We introduce two additional performance optimizations: incremental triangle stripping and priority-computation deferral lists. ROAM's execution time is proportional to the number of triangle changes per frame, which is typically a few percent of the output mesh size; hence ROAM's performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported.

[1]  Steven Skiena,et al.  Optimizing triangle strips for fast rendering , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[2]  James J. Little,et al.  Automatic extraction of Irregular Network digital terrain models , 1979, SIGGRAPH.

[3]  Daniel Cohen-Or,et al.  Temporal continuity of levels of detail in Delaunay triangulated terrain , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[4]  Amitabh Varshney,et al.  Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[5]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[6]  Jihad El-Sana,et al.  Adaptive Real-Time Level-of-Detail-Based Rendering for Polygonal Models , 1997, IEEE Trans. Vis. Comput. Graph..

[7]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[8]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[9]  William Ribarsky,et al.  Real-time, continuous level of detail rendering of height fields , 1996, SIGGRAPH.

[10]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[11]  Joseph S. B. Mitchell,et al.  Automatic generation of triangular irregular networks using greedy cuts , 1995, Proceedings Visualization '95.

[12]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[13]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[14]  Michael Garland,et al.  Multiresolution Modeling for Fast Rendering , 1999 .

[15]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[16]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.

[17]  Markus H. Gross,et al.  Fast Multiresolution Surface Meshing , 1995, IEEE Visualization.

[18]  Mark Christopher Miller Multiscale compression of digital terrain data to meet real-time rendering rate constraints , 1995 .

[19]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[20]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.