检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统仿真学报》2013年第9期2184-2187,共4页Journal of System Simulation
摘 要:凸组合球面参数化是根据网格的边界点来运算的,由于零亏格封闭三角网格没有边界条件,传统的凸组合参数化方法需对原始网格进行切割或根据预先设置的固定点,通过构建非线性方程组,对三角网格所有顶点进行凸组合运算,其计算量大,效率低。因此提出一种在网格内部寻找边界点的方法,通过对原始网格预处理,筛选出需凸组合计算的顶点,判断出此区域的边界点,只对这一参数化后结果无效的区域做凸组合运算。与已有方法相比,大幅降低了求解方程组的数目。同时改进传统求解方式,进一步降低求解难度。实验结果表明:该方法大幅提高模型球面参数化的运算效率。Spherical convex combination parameterization is operated on the mesh boundary points. Since the zero genus closed triangular mesh has no boundary condition, the conventional convex combination parameterization method needs to cut the original mesh or use the fixed points and constructs nonlinear equations. The operation on all points on triangular mesh is computationally intensive and inefficient. Therefore a method to find the boundary points within the grid was proposed. Original mesh grid was preprocessed and the vetices to be computed for convex combination were filtered. The boundary points of the area were determined and convex combination operation was done on this area which had no valid parameterization result. The number of equations to be solved was dramatically reduced compared with the existing methods. The traditional methods were improved by constructing linear equations and the computation complexity was reduced. The experimental results show that this method greatly improves operational efficiency of spherical parameterization of the model.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.82.212