An optimization-driven approach for computing geodesic paths on triangle meshes
Authors:
- Bangquan LiuBLBangquan Liu
- Shuangmin ChenSCShuangmin Chen
- Shi-Qing XinSXShi-Qing Xin
- Ying HeYHYing He
- Zhen LiuZLZhen Liu
- Jieyu ZhaoJZJieyu Zhao
- 1 September 2017
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 90, 105-112
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61373068, 61571247, U1636111)
- Ningbo University
This publication has 28 references indexed in Scilit:
- Practical Anisotropic GeodesyComputer Graphics Forum, 2013
- Biharmonic distanceACM Transactions on Graphics, 2010
- Improving Chen and Han's algorithm on the discrete geodesic problemACM Transactions on Graphics, 2009
- Parallel algorithms for approximation of distance maps on parametric surfacesACM Transactions on Graphics, 2008
- Non‐Rigid Registration Under Isometric DeformationsComputer Graphics Forum, 2008
- Computing geodesics on triangular meshesComputers & Graphics, 2005
- Fast exact and approximate geodesics on meshesACM Transactions on Graphics, 2005
- Geodesic winding on conical surfaces of arbitrary profileMechanics of Composite Materials, 1993
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- On Shortest Paths in Polyhedral SpacesSIAM Journal on Computing, 1986