geodisc distance

[1] Chen J, Han Y. Shortest paths on a polyhedron, part I: Computing shortest paths. Int’l Journal Computational Geometry and Application, 1996,6(2):127−144.

http://www2.cs.sfu.ca/~haoz/teaching/projects/cmpt469/0501/luan.pdf

 

[2] Kaneva B, O’Rourke J. An implementation of Chen & Han’s shortest paths algorithm. In: Bremner D, ed. Proc. of the 12th Canadian Conf. on Computational Geometry. Fredericton: University of New Brunswick, 2000. 139−146.

Chen和Han提出了一种精确计算测地线的方法[1],并且该算法由Kaneva等人部分实现

code:http://cs.smith.edu/~orourke/ShortestPaths/

 

[3] Kimmel R, Sethian JA. Computing geodesic paths on manifolds. Proc. of the National Academy of Sciences, 1998,95(15): 8431−8435.

http://math.berkeley.edu/~sethian/2006/Papers/sethian.kimmel.geodesics.pdf

Kimmel和Sethian使用快速跟踪法(fast-marching method)近似计算网格上的测地线.在这种方法的基础上, Novotni和Klein改进其更新步骤以获得更高的精确

 

[4] Novotni M, Klein R. Computing geodesic distances on triangular meshes. In: Skala V, ed. Proc. of the 10th Int’l Conf. in Central Europe on Computer Graphics, Visualization and Computer Vision. Plzen: University of West Bohemia, 2002. 341−347.

 

[5] Surazhsky V, Surazhsky T, Kirsanov D, Gortler SJ, Hoppe H. Fast exact and approximate geodesics on meshes. ACM Trans. on Graphics, 2005,24(3):553−560.

 

[6] This is an implementation of exact geodesic algorithm for triangular mesh (first described by Mitchell, Mount and Papadimitriou in 1987) with some minor improvements

matlab: http://www.mathworks.cn/matlabcentral/fileexchange/18168-exact-geodesic-for-triangular-meshes

c++:http://code.google.com/p/geodesic/

 

[7] Level Set Methods and Fast Marching Methods Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, J.A. Sethian, Cambridge University Press, 1999, Cambridge Monograph on Applied and Computational Mathematics

http://www.wisdom.weizmann.ac.il/~boiman/reading/level_sets/sethian_book.pdf

 

[8] A Fast O(N) Implementation of the Fast Marching Algorithm
Liron Yatziv, Alberto Bartesaghi and Guillermo Sapiro.
Journal of Computational Physics, vol. 212, pp. 393-399, 2006
http://yatziv.com/fastmarching/

 

Fast Marching

http://www.ceremade.dauphine.fr/~peyre/matlab/fast-marching/content.html

http://math.berkeley.edu/~sethian/2006/Explanations/fast_marching_explain.html

http://www.ceremade.dauphine.fr/~peyre/matlab/fast-marching/content.html

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值