{"id":2211,"date":"2024-04-18T11:10:50","date_gmt":"2024-04-18T15:10:50","guid":{"rendered":"https:\/\/brickisland.net\/DDGSpring2024\/?p=2211"},"modified":"2024-04-18T11:43:05","modified_gmt":"2024-04-18T15:43:05","slug":"assignment-5-coding-geodesic-distance-due-4-27","status":"publish","type":"post","link":"https:\/\/brickisland.net\/DDGSpring2024\/2024\/04\/18\/assignment-5-coding-geodesic-distance-due-4-27\/","title":{"rendered":"Assignment 5 [Coding]: Geodesic Distance (Due 4\/25)"},"content":{"rendered":"

<\/center>Note:<\/strong> For the final assignment, you can do either this assignment or A6. Overall, you just need to be sure you completed A0 and A1, as well as 3 of the assignments A2\u2013A6 (your choice which ones).<\/p>\n

For the coding portion of this assignment, you will implement the heat method<\/em>, which is an algorithm\u00a0for computing geodesic distance on curved surfaces. All of the details you need for implementation are described in Section 3 of the paper<\/a>, up through and including Section 3.2. Note that you need only be concerned with the case of triangle meshes<\/b> (not polygon meshes or point clouds); pay close attention to the paragraph labeled \u201cChoice of Timestep.\u201d<\/p>\n

Please implement the following routines in:<\/p>\n

    \n
  1. projects\/geodesic-distances\/heat-method.[js\/cpp]<\/tt>:\n
      \n
    1. constructor<\/tt><\/li>\n
    2. computeVectorField<\/tt><\/li>\n
    3. computeDivergence<\/tt><\/li>\n
    4. compute<\/tt><\/li>\n<\/ol>\n<\/li>\n<\/ol>\n

      Notes<\/strong><\/p>\n