Terrain Visualization is an important part of visualization systems of battlefield,and the visualization of dynamic terrain is also important for dynamic battle environment.In this paper,special attention has been pai...Terrain Visualization is an important part of visualization systems of battlefield,and the visualization of dynamic terrain is also important for dynamic battle environment.In this paper,special attention has been paid on real-time optimally adapting meshes (ROAM) algorithm,which is a candidate for dynamic terrain,and its mesh representation,mesh continuity algorithm and error metrics are discussed.The DEXTER-ROAM algorithm is discussed and analyzed.By revising the mesh representation of ROAM,a dynamic ROAM algorithm based on partial-regular grid is established.By introducing transition region,mesh discontinuity of dynamic partial-regular grid is resolved.Error metric blocks are removed for computation complexity and culling blocks are introduced to accelerate view frustum culling.The algorithm is implemented in a 3D rendering engine called OGRE.In the end,an example of dynamic crater is given to examine the dynamic ROAM algorithm.展开更多
文摘Terrain Visualization is an important part of visualization systems of battlefield,and the visualization of dynamic terrain is also important for dynamic battle environment.In this paper,special attention has been paid on real-time optimally adapting meshes (ROAM) algorithm,which is a candidate for dynamic terrain,and its mesh representation,mesh continuity algorithm and error metrics are discussed.The DEXTER-ROAM algorithm is discussed and analyzed.By revising the mesh representation of ROAM,a dynamic ROAM algorithm based on partial-regular grid is established.By introducing transition region,mesh discontinuity of dynamic partial-regular grid is resolved.Error metric blocks are removed for computation complexity and culling blocks are introduced to accelerate view frustum culling.The algorithm is implemented in a 3D rendering engine called OGRE.In the end,an example of dynamic crater is given to examine the dynamic ROAM algorithm.
