Fast Approximate Geodesic Paths on Triangle Mesh  

作　　者：Jie Tang Gang-Shan Wu Fu-Yan Zhang Ming-Min Zhang 

机构地区：[1]State Key Laboratory for Novel Software Technology, Nanjing University, Nanjiag 210093, PRC [2]School of Computer Science, Zhejiang University, Hangzhou 310027, PRC

出　　处：《International Journal of Automation and computing》2007年第1期8-13,共6页国际自动化与计算杂志（英文版）

基　　金：This work was supported by National Natural Science Foundation of PRC(No.60503058,No.60533080);the Science and Technology Fund of Huawei Technologies Co.,Ltd.

摘　　要：We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.We present a new algorithm to compute a geodesic path over a triangle mesh. Based on Novotni＇s propagating wavefront method which is similar to the well known Dijkstra algorithm, we made some improvements which Novotni had missed and we also gave the method to find out the geodesic path which Novotni had not. It can handle both convex and non-convex surfaces or even with boundaries. Experiment results show that our method works very well both in efficiency and precision.

关 键 词：Triangle mesh geodesic path virtual reality. 

分 类 号：TP27[自动化与计算机技术—检测技术与自动化装置]