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 execution time is proportionate to the number of triangle changes per frame, which is typically a few percent of the output mesh size, hence ROAM performance is insensitive to the resolution and extent of the input terrain. Dynamic terrain and simple vertex morphing are supported. The paper can be downloaded in: [PostScript] [PDF] [Gzipped Tar].
|
Last modified: October 19, 1997
For more information about the technical content of these pages,
contact:
For information about the construction of these pages,
contact: UCRL-JC-127870 LLNL Home Page LLNL Disclaimer |