文件名称:A-3D-Center-Path-Finding-Algorithm
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
通过两个距离场的共同约柬来快速地提取出一条连接起点和终点的中心路径．同时为了保证褪游的效果．还采用3次B样条曲线对所获取的路径进行了光滑-As compared with onion peeling algorithm and Dijkst ra’s Single Source
Shortest Path Algorithm、the result shows that the algorithm not only cart get last speed and high quality result，
but also has more flexibility．’l he application in Virtual endoscopy is also shown in the end of the paper．
Shortest Path Algorithm、the result shows that the algorithm not only cart get last speed and high quality result，
but also has more flexibility．’l he application in Virtual endoscopy is also shown in the end of the paper．
(系统自动生成,下载前可以参看下载内容)
下载文件列表
A 3D Center Path Finding Algorithm.pdf