This reading complements our lecture on algorithms for computing geodesic paths with an overview of algorithms for computing geodesic distances:
- Crane, Livesu, Puppo, Qin, “A Survey of Algorithms for Geodesic Paths and Distances” (2020), pp. 1–20.
As with many of our readings, the point here is to just get a broader perspective of the material covered in lecture—you are not responsible for knowing every little detail. The algorithms discussed in Section 3 especially are well-connected to the perspective & tools we’ve been developing throughout the semester (e.g., the discrete Laplacian), and will help get you prepared for the assignment on computing geodesic distance. For this reading you should summarize the high-level ideas from the first part of the survey, and any questions you might have.
Your short 2-3 sentence summary is due by 10am Eastern on April 19, 2022. Handin instructions can be found on the assignment page.