为了解决蜘蛛网格算法在图像漫游中局限性，提出了双灭点的松弛蜘蛛网格算法。该算法在用于图像实时漫游时，用双灭点进行计算，其与前人提出的方法相比，更具通用性，不仅可以解决单灭点、双灭点、多灭点和灭线等不同类型的照片漫游问题，而且减轻了用户交互的工作量。此外，为了进一步提高图像的绘制质量，以获得高质量的漫游效果，还采用了一种分片绘制的策略。多种类型的图片实验证明了该算法的有效性。

A new approach for solving the spidery mesh limits in image based virtual touring , which uses a relaxing spidery mesh with two vanishing points, is proposed in this paper. Comparing with other researches work, this approach can be applied to a wider range of images for walkthrough. We have found that it can tour into the picture which has only one vanishing point, double vanishing point, and multiple vanishing points. The test result also shows that our approach can be effectively applied to the picture which contains vanishing line. In our approach, the interactive work is very simple as the user need only to interactively choose two vanishing points, the background and front object. To avoid the texture distortion, a small block texture mapping technique is used to improve the rendering quality of scene. In the test, different kinds of images are used to show the effectiveness of our approach.