{"id":575,"date":"2021-04-23T17:23:33","date_gmt":"2021-04-23T14:23:33","guid":{"rendered":"https:\/\/kadircenk.com\/blog\/?p=575"},"modified":"2021-04-23T17:28:19","modified_gmt":"2021-04-23T14:28:19","slug":"process-the-mesh-part-1-geodesic-distance-farthest-point-sampling-agd-and-mgd-local-maximas","status":"publish","type":"post","link":"https:\/\/kadircenk.com\/blog\/process-the-mesh-part-1-geodesic-distance-farthest-point-sampling-agd-and-mgd-local-maximas\/","title":{"rendered":"Process the Mesh – Part 1 (Geodesic Distance, Farthest Point Sampling, AGD and MGD Local-Maximas)"},"content":{"rendered":"\n

Hello mesh processing masters!<\/p>\n\n\n\n

In the “Process the Mesh” series, I will be writing about the things I have implemented for the course Ceng789 – Digital Geometry Processing<\/a> given by Assoc. Prof. Yusuf Sahillio\u011flu<\/a> at CENG, METU.<\/p>\n\n\n\n

In this post, I will show the screenshots of the results of my implementation of Homework Assignment 1.<\/p>\n\n\n\n\n\n\n\n

Geodesic Distance<\/h2>\n\n\n\n

When we represent the surface of a mesh as a graph, the Geodesic Distance is the approximated shortest path between two vertices of the mesh on this graph (total lengths of the edges in between). It is calculated by running Dijkstra’s Shortest Path algorithm on the graph.<\/p>\n\n\n\n

Here are some screenshots from my implementation of finding GD path between 2 query points (vertices) on some meshes:<\/p>\n\n\n\n

\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div><\/div><\/div>\n\n\n\n

Farthest Point Sampling<\/h2>\n\n\n\n

This algorithm finds the farthest 10 vertices on the surface of the given mesh. Here are the screenshots of the results of my implementation:<\/p>\n\n\n\n

\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div><\/div><\/div>\n\n\n\n

Average Geodesic Distance and Minimum Geodesic Distance Local-Maxima Finding<\/h2>\n\n\n\n

AGD is the average distance of a vertex to all other vertices of the mesh. After finding AGD of each vertex, AGDs are smoothed over the 1-ring vertex neighbourhood of each vertex. Local-AGD-maxima-vertices are then found by checking among 1-ring neighbourhood of each vertex and added to S1 list. MGD is the minimum GD of a vertex when the GDs of this vertex to each of the members of the S1 list is considered. Local-MGD-maxima-vertices are the local-maximas among their 1-ring neighbourhoods. They are also added to the S1 list, creating the final S2 list, which includes intrinsically-symmetric points, such as feet, hands and ears. The S2 list is then visualized using small spheres on each vertex. Here are my screenshots, notice the tips and inner sides of the cat’s ears, and extreme points of all meshes:<\/p>\n\n\n\n

\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div>
\"\"<\/figure><\/div><\/div><\/div><\/div>\n\n\n\n

Cool Study Moment When The Music Matches The Visuals<\/h2>\n\n\n\n

Here is a cool moment I’ve captured while implementing the assignment, when the random Spotify music is in perfect sync with the colors and the animation of the mesh. \ud83d\ude42<\/p>\n\n\n\n

\n