首页 | 本学科首页   官方微博 | 高级检索  
     

点云模型上测地线的计算
引用本文:杜培林,屠长河,王文平.点云模型上测地线的计算[J].计算机辅助设计与图形学学报,2006,18(3):438-442.
作者姓名:杜培林  屠长河  王文平
作者单位:1. 山东大学计算机科学与技术学院,济南,250061
2. 山东大学计算机科学与技术学院,济南,250061;香港大学计算机科学系,香港
摘    要:给定点云模型上2点,将点云数据沿与xyz三坐标轴垂直方向进行单元剖分后,采用Dijkstra算法求出2点间的最短路径作为初始测地线;然后通过带弧长最短约束的平方距离最小化方法对初始测地线进行迭代优化,计算得到点云模型上给定2点间的一条样条表示的精确测地线.文中算法只需局部拟合抛物曲面,无需对点云模型进行三角化或曲面重建,适合大规模点云数据模型上测地线的计算.

关 键 词:测地线  点云  Dijkstra算法  平方距离最小化
收稿时间:2005-04-29
修稿时间:2005-07-14

Computing Geodesics on Point Clouds
Du Peilin,Tu Changhe,Wang Wenping.Computing Geodesics on Point Clouds[J].Journal of Computer-Aided Design & Computer Graphics,2006,18(3):438-442.
Authors:Du Peilin  Tu Changhe  Wang Wenping
Abstract:Given two points on an object represented by point cloud, we first obtain an approximately shortest path between the two points as an initial active curve by using Dijkstra's algorithm, then we use square distance minimization method to compute the active curve iteratively to be the geodesic between the two points on the point cloud. We define the objective function to be constraints of the distance between the active curve and the point cloud as well as the arc length of the active curve, and then minimize the objective function step by step by relocating the control points of the active curve until a convergence result is achieved. The method avoids triangulating or reconstructing the point cloud to be a surface model so that it is practicable for dealing with the point cloud with a huge number of scattered points.
Keywords:geodesic curves  point cloud  Dijkstra's algorithm  square distance minimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号