Please use this identifier to cite or link to this item:
|Title:||Computing geodesics on discrete surfaces||Authors:||Chedrawi, Cynthia||Advisors:||Farah, Farah||Subjects:||Geodesics (Mathematics)||Issue Date:||2019||Abstract:||
Geodesics are shortest paths between two points on a surface. In smooth differential geometry, various methods of finding geodesics on surfaces exist. These methods are not the same methods used in discrete differential geometry since there exists a difference between a smooth surface and a discrete one. Two methods for computing discrete geodesics are presented in this project. One uses a graph to compute the geodesic and another one solves the differential equation. Implementing these two algorithms to a triangle mesh of a sphere, the outputs were different in the accuracy, complexity, length, and uniqueness.
Includes bibliographical references (p. 35-36).
Supervised by Dr. Farah Farah.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/3847||Rights:||This object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holder||Ezproxy URL:||Link to full text||Type:||Project|
|Appears in Collections:||UOB Theses and Projects|
Show full item record
checked on Oct 21, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.