Focusing on the high error and time consuming of the algorithms for shape from shading (SFS), a fast viscosity solution algorithm of perspective SFS (PSFS-FVS) is proposed.
针对传统的从明暗恢复形状(SFS)算法存在误差大、耗时长的问题，提出了一种SFS的快速黏性解算法(PSFS - FVS)。
A fast intersection algorithm for ray and NURBS surface is presented. The algorithm bases on the Newton iteration solution for equation set.
提出了一种基于牛顿迭代法解方程组的射线和NURBS曲面求交算法。
Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.
通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。
Experiment shows that new algorithm is obviously fast than basic ant algorithm, and good point crossover operator is benefit to optimization of solution.
实验结果表明：新提出的算法明显快于基本蚁群算法，佳点集杂交算子对解的优化有较好的作用。
The example result shows that in the genetic algorithm the optimum global solution can be gained and the convergence speed is fast.
算例结果表明，用该方法能以较快的速度收敛于全局最优解。
The example result shows that in the genetic algorithm the optimum global solution can be gained and the convergence speed is fast.
算例结果表明，用该方法能以较快的速度收敛于全局最优解。
应用推荐