A Hybrid Simplification Algorithm for Large Scale Terrain

In the field of terrain visualization, the most efficient tool for real-time rendering of complex landscape is level of detail technique. In this paper, an algorithm for building delaunay of high efficiency on the ground of terrain application is presented, it makes use of the advantage of both the quad tree and TIN structure. At first, the large scale discrete points are divided by quad tree. Secondly, use different smooth error in each patch to construct the triangulation net; it is the view dependent terrain simplification. Lastly, deal with the transition of the different patch using an efficient error metric, which can also eliminate the crack. The experiment result indicates the efficiency of the arithmetic