Research On Simplification Algorithm For Large-Scale Terrain Grid

Although terrain rendering algorithms have been studied for a long time, it is still a very active field in computer graphics. Real-time rendering technology for large-scale terrain grid is becoming a hot field which attracts more and more researchers'attention at present. It has been widely used in 3D geographic information system, military simulation and virtual reality. In this thesis, we principal study for terrain grid simplification algorithm based on regular meshes, top-down (coarse-to-fine), multi-resolution.Today, there exist a lot of different simplification algorithms for large-scale terrain grid, each having its own strengths and drawbacks. In this paper we start out with briefly describing and comparing several well known and successful algorithms. The famous algorithms include View-Dependent Progressive Meshes, Real-time Optimal Adaptive Meshes and Stateless One-pass Adaptive Refinement. Then, based on SOAR algorithm, we introduce the improved real-time refinement that restricted on the left-only and right-only branch, respectively, anisotropic metrics of error projection and geo-morphing based on it, and on the basis of fractal geometry theory, we construct an alternative out-of–core paging data layout based on the -order space filling curve. At last, implement the improved algorithm's function by programming and gained a 3D visualization terrain engine that can be real-time roaming, and testing the practical feasibility and effectiveness of the improved algorithm.Π...