A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Efficient and practical algorithms for discrete geodesics
Computing exact geodesic distance plays an important role in many graphics applications. Many research studies have been undertaken in this area since the 1980s. However, the existing geodesic algorithms are not practical for large-scale models or time-critical applications. First, the existing algorithms compute exact geodesic in a serial manner due to the lack of a parallel structure. The computation of geodesic on a large-scale model could be very time-consuming. I am grateful to all thosedoi:10.32657/10356/54871 fatcat:yjisjdtqrjgorhitkes6vsylzy