{"id":3346,"date":"2022-04-12T01:05:50","date_gmt":"2022-04-12T05:05:50","guid":{"rendered":"https:\/\/brickisland.net\/DDGSpring2022\/?p=3346"},"modified":"2022-01-17T16:56:12","modified_gmt":"2022-01-17T21:56:12","slug":"reading-8-geodesic-algorithms","status":"publish","type":"post","link":"https:\/\/brickisland.net\/DDGSpring2022\/2022\/04\/12\/reading-8-geodesic-algorithms\/","title":{"rendered":"Reading 8: Geodesic Algorithms (due 4\/19)"},"content":{"rendered":"<p>This reading complements our lecture on algorithms for computing geodesic\u00a0<em>paths<\/em> with an overview of algorithms for computing geodesic\u00a0<em>distances:<\/em><\/p>\n<ul>\n<li>Crane, Livesu, Puppo, Qin, <a href=\"http:\/\/www.cs.cmu.edu\/~kmcrane\/Projects\/GeodesicSurvey\/GeodesicSurvey.pdf\"><em>\u201cA Survey of Algorithms for Geodesic Paths and Distances\u201d<\/em><\/a> (2020), pp. 1\u201320.<\/li>\n<\/ul>\n<p>As with many of our readings, the point here is to just get a broader perspective of the material covered in lecture\u2014you are not responsible for knowing every little detail. The algorithms discussed in Section 3 especially are well-connected to the perspective &amp; tools we&#8217;ve been developing throughout the semester (e.g., the discrete Laplacian), and will help get you prepared for the assignment on computing geodesic distance.\u00a0 For this reading you should summarize the high-level ideas from the first part of the survey, and any questions you might have.<\/p>\n<p>Your short 2-3 sentence summary is due by <strong>10am Eastern on April 19, 2022.\u00a0<\/strong>\u00a0Handin instructions can be found on the <a href=\"http:\/\/brickisland.net\/DDGSpring2022\/assignments\/\">assignment page<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>This reading complements our lecture on algorithms for computing geodesic\u00a0paths with an overview of algorithms for computing geodesic\u00a0distances: Crane, Livesu, Puppo, Qin, \u201cA Survey of Algorithms for Geodesic Paths and Distances\u201d (2020), pp. 1\u201320. As with many of our readings, the point here is to just get a broader perspective of the material covered in &hellip; <a href=\"https:\/\/brickisland.net\/DDGSpring2022\/2022\/04\/12\/reading-8-geodesic-algorithms\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Reading 8: Geodesic Algorithms (due 4\/19)&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[2],"tags":[],"_links":{"self":[{"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/posts\/3346"}],"collection":[{"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/comments?post=3346"}],"version-history":[{"count":2,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/posts\/3346\/revisions"}],"predecessor-version":[{"id":3424,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/posts\/3346\/revisions\/3424"}],"wp:attachment":[{"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/media?parent=3346"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/categories?post=3346"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/brickisland.net\/DDGSpring2022\/wp-json\/wp\/v2\/tags?post=3346"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}