.png){kind=icon}
返回
An optimization-driven approach for computing geodesic paths on triangle meshes
.png){kind=icon}
OA
AI
DOI：10.1016/j.cad.2017.05.022.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There are many application scenarios where we need to refine an initial path lying on a surface to be as short as possible. A typical way to solve this problem is to iteratively shorten one segment of the path at a time. As local approaches, they are conceptually simple and easy to implement, but they converge slowly and have poor performance on large scale models. In this paper, we develop an optimization driven approach to improve the performance of computing geodesic paths. We formulate the objective function as the total length and adopt the L-BFGS solver to minimize it. Computational results show that our method converges with super-linear rate, which significantly outperforms the existing methods. Moreover, our method is flexible to handle anisotropic metric, non-uniform density function, as well as additional user-specified constraints, such as coplanar geodesics and equally-spaced geodesic helical curves, which are challenging to the existing local methods. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Geodesic paths
Geodesic helical curves
Optimization
Anisotropic metric
Non-uniform density
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.1K
被引数:
6.4K
机构
引用论文
Thermal Cyclization of Copper Carbenoid of α‐Dizao α‐Phosphorylacetate: Unexpected and Novel Access to Oxaphosphiraneα‐Dizao α‐磷酰基乙酸酯的铜卡宾类似物的热环化反应：对氧磷杂环丙烷的意外且新颖的合成途径
.png){kind=icon}
PREAI
分享收藏
Saddle Vertex Graph (SVG): A Novel Solution to the Discrete Geodesic Problem鞍顶点图 (SVG): 离散测地问题的新解决方案
PREAI
分享收藏
查看更多内容