Research on Fast Visibility Judgment Algorithms Based on n-Fork Tree

Abstract

In this complex geometric environment, the graphical scene model tends to be diversified and complicated. To reduce the complexity of the model, it is necessary to make a fast visibility judgment before rendering the scene model and remove the important part of the real-time graphics display when the occluded elements are processed. A fast algorithm is proposed in this paper, which can deal with dynamic complex scenes. Real-time visibility judgment is made, and it is suitable for outdoor scenes with non-cavern structure. The algorithm organizes the whole scene with n-fork tree based on terrain using the idea of layering, and uses the double positioning method of linked list array to realize it. It not only saves the storage space effectively, but also locates the data nodes to be processed quickly, which greatly accelerates the process of view clipping and occlusion judgment.