递归特性 meaning in Chinese
recursive nature
Examples
- The dividing process is recorded by octree , and then we make out the rapid adjacent - field searching algorithm using envelopment - box ' s recursion feature . this algorithm can also kick off some noise - points from the data cloud . it make the consequent process of surface reconstruction more convenience and precise
分割过程采用八叉树来记录，并利用包围盒的递归特性实现了点的邻域的快速搜索算法，同时可以有效地排除噪声点，显著减少了密集散乱数据点云几何建模所花费的时间，提高了建模效率。 - Two block time - recursive algorithms are developed for the efficient and fast computation of the 1 - d rdgt coefficients and for the fast reconstruction of the original signal from the coefficients in both the critical sampling case and the oversampling case . the two algorithms are implemented respectively by a unified parallel lattice structure . and the computational complexity analysis and comparison show that the proposed algorithms provide a more efficient and faster method for the computation of the discrete gabor transforms
首先论证了一维rdgt系数求解算法和由变换系数重建原信号算法，不论是在临界抽样条件下还是在过抽样条件下，都同样具有块时间递归特性，并提出了相应的块时间递归算法及其并行格型结构实现方法，计算机模拟验证了并行格型结构实现的可行性，计算复杂性分析与比较也说明了rdgt块时间递归算法的并行格型结构在计算时间方面所具有的高速和高效性能。