Our next reading is pages 1-20 of the article “A Survey of Algorithms for Geodesic Paths and Distances” by Crane, Livesu, Puppo and Qin. This reading complements our lecture on algorithms for computing geodesic paths with an overview of algorithms for computing the geodesic distance function. 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.  As usual, you should write a short 2-3 sentence summary, plus one question about something you didn't understand or want to know more about. Handin instructions can be found in the Readings section of the main page.