ETD

• computational geometry
• computer graphics

We propose a method to accelerate the computation of geodesic over triangular meshes. The method is based on a precomputation step that allows to store arbitrary complex distance metrics and a query step where we employ a modified version of the bidirectional A* algorithm. We show how this method is significantly faster then the classical Dijkstra algorithm for the computation of point to point distance. Moreover, as we precompute the exact geodesic, it achieves better accuracy.