Computing geodesics on triangular meshes

被引：71

作者：

Martínez, D

Velho, L

Carvalho, PC

机构：

[1] IMPA, Inst Nacl Matemat Pura & Aplicada, BR-22460320 Rio De Janeiro, RJ, Brazil

[2] ICIMAF Inst Cibernet Matemat & Fis, Havana, Cuba

来源：

COMPUTERS & GRAPHICS-UK | 2005年 / 29卷 / 05期

关键词：

shortest geodesic; manifold triangulation; curve evolution;

D O I：

10.1016/j.cag.2005.08.003

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：667 / 675

页数：9