This repository contains the implementation of my first CENG589 Digital Geometry Processing course assignment, focusing on geodesic distances, descriptors (Gaussian curvature and average geodesic distance), farthest point sampling, and Laplacian smoothing. The assignment is based on the Dijkstra's Shortest Path algorithm and utilizes the Coin3D Open Inventor renderer for visualization.
Features:
- Computation of geodesic distances between mesh vertices using Dijkstra's algorithm. The algorithm is implemented using a array, min-heap, and fibonacci heap.
- Calculation of Gaussian curvature and average geodesic distance for each vertex.
- Visualization of geodesic paths between query points on the mesh.
- Sampling of points using farthest point sampling (FPS) and computing geodesic distances to the samples.
- Smoothing of models using Laplacian smoothing.
- Coloring of triangles based on quality using the circum-radius to minimum edge length ratio.
- Supports the .off file format for representing input meshes.
- Programs C++
- Category Computer Graphics
- Date April , 2023
- Link https://github.com/ramazantokay/Digital-Geometry-Processing