This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansions during the mesh traversal. We propose a new type of triangular mesh that minimizes the expected number of expansions assuming the query points are drawn from a known probability distribution. We design a heuristic method to approximate the mesh and evaluate the approach on many challenging instances that resemble real-world environments. The proposed mesh improves the mean query times by 12-16% compared to the reference constrained Delaunay triangulation. The approach is suitable to boost offline applications that require computing millions of queries without addressing the preprocessing time. The implementation is publicly available to replicate our experiments and serve the community.

翻译：本文针对通过寻找最有利的三角网格实例（预处理结构）来改进三角扩展算法计算可见区域查询性能的问题。TEA递归遍历网格，同时跟踪可见区域——即多边形世界中从查询点可见的所有点的集合。我们证明，实测查询时间大致与网格遍历过程中的三角形边扩展次数成正比。我们提出了一种新型三角网格，在假设查询点服从已知概率分布的情况下，该网格能最小化期望扩展次数。我们设计了一种启发式方法来近似该网格，并在多个模拟真实环境的挑战性实例上评估了该方法。与参考的约束Delaunay三角剖分相比，所提出的网格将平均查询时间提升了12-16%。该方法适用于需要计算数百万次查询且不涉及预处理时间的离线应用加速。实现代码已公开，可供复现实验并服务研究社区。