Parallel computation of discrete geodesics and its applications
Computing geodesics on meshes is a classical problem in computational and differential geometry. It measures the length of the local shortest path with minimum curvature along the surface between two points. Previous studies have documented many important properties of geodesics, such as being a dis...
Main Author: | Le, Tien Hung |
---|---|
Other Authors: | He Ying |
Format: | Thesis |
Language: | English |
Published: |
2017
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/72861 |
Similar Items
-
Robust discrete geodesic and its applications in digital geometry processing
by: Dao Thi Phuong Quynh
Published: (2013) -
Parallel discrete geodesic algorithms
by: Du, Jie
Published: (2020) -
Initial value problem of discrete geodesics and its application
by: Cheng, Peng
Published: (2016) -
Manifolds all of whose geodesics are closed /
by: 329864 Besse, Arthur L.
Published: (1978) -
Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
by: Basu, Saugata, et al.
Published: (2009)