Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.advisorFarah, Farahen_US
dc.contributor.authorChedrawi, Cynthiaen_US
dc.descriptionIncludes bibliographical references (p. 35-36).en_US
dc.descriptionSupervised by Dr. Farah Farah.en_US
dc.description.abstractGeodesics 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.en_US
dc.description.statementofresponsibilityCynthia Chedrawien_US
dc.format.extentvii, 36 p. :ill. ;30 cmen_US
dc.rightsThis 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 holderen_US
dc.subject.lcshGeodesics (Mathematics)en_US
dc.titleComputing geodesics on discrete surfacesen_US
dc.contributor.departmentDepartment of Mathematicsen_US
dc.contributor.facultyFaculty of Arts and Sciencesen_US
dc.contributor.institutionUniversity of Balamanden_US
dc.description.degreeMSc in Mathematicsen_US
Appears in Collections:UOB Theses and Projects
Show simple item record

Record view(s)

checked on Dec 4, 2021

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.