Discrete geodesic graphs

The discrete geodesic problem aims to find the shortest path and distance between arbitrary points on discrete surfaces. It is significant in a variety of computational geometry applications, such as surface parameterization and distance-based shape descriptors for shape analysis. As discrete surf...

Full description

Saved in:
Bibliographic Details
Main Author: Fang, Zheng
Other Authors: He Ying
Format: Theses and Dissertations
Language:English
Published: 2019
Subjects:
Online Access:https://hdl.handle.net/10356/90288
http://hdl.handle.net/10220/48533
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Be the first to leave a comment!
You must be logged in first