采用基于约束驱动的几何推理和自由度计算方法，设计了约束检查策略与算法，解决了过约束与欠约束检查问题。
This paper introduces a method which uses geometry reasoning & degrees of freedom calculating based on constraint driven to solve the problem of checking over constraint & under constraint.
该算法用于解决辅助工具中处理复杂几何模型时的关键问题。
The main contribution of algorithm is to solve the key problem in processing complex geometry model.
针对目前隐身飞行器外形雷达散射截面(RCS)难以准确计算的问题，提出了一种基于目标外形几何特征和矩量法的飞行器r CS算法。
In order to solve the problem, a new algorithm for calculating RCS is presented based on the geometrical characteristic of target aircraft configurations and the method of moment (mom).
对一类非线性问题的空间分解算法证明了两个几何收敛性定理，改进了已有的结果。
Two geometrical convergence theorems of a space decomposition method for solving a kind of nonlinear problems have been proved, which are improvements of existing results.
本文建立的面向数字几何模型的多分辨率数值算法模型为解决该问题提供了必要的基础。
The multiresolution numerical modeling method oriented to the digital geometry is developed, that can be used to solve the problem.
探讨解决了一些设计上的问题，诸如构造场景图与几何建模、坐标变换迭代算法、碰撞响应处理等。
Some design problems were discussed and solved such as Scene Graph, Shape Modeling, iterative algorithm on coordinate transform and collision response etc.
为优化装配系统中公差链的公差值，建立了几何尺寸公差的优化模型，并提出公差的分层优化设计算法：第一层，解决设计公称值居中的优化问题；
In order to optimize tolerance values for an assembly system, a model for geometric dimension tolerance optimization was established and an algorithm for optimal tolerance design was proposed.
从代数动力学算法的观点考察了辛几何算法和龙格-库塔算法的保真问题。
The symplectic geometric algorithm and the Ronge-Kutta algorithm are examined from the viewpoint of the algebraic dynamical algorithm.
取得的结果不仅可直接应用于避障路径规划算法的设计与实现，而且还可应用于计算几何中相关问题的求解。
The obtained results can not only been applied to the design and implementation of algorithm for avoidance obstacle path planning, but also been used to solve the problems of computational geometry.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.
提出一种解决几何非线性问题的优化算法，研究了悬臂压杆的几何非线性大变形问题。
An optimum algorithm is proposed to solve the geometrically nonlinear problem of large deformation of a cantilever under pressure on free end.
提出一种求解几何非线性问题的优化算法，并研究了简支梁的几何非线性大变形问题。
An optimum algorithm is proposed to solve the geometrically nonlinear problem for a simply-supported beam with large deformation.
本文针对参数化总体设计，提出了基于离散算法的物性快速求解算法，解决了参数化设计中常见的几何特征值快速算法问题。
Based on discrete algorithm, rapid algorithms for geometric mass property calculation are presented in this paper, which are very useful in products' parametric preliminary configuration design.
在给定的约束条件下，几何规划算法可以全局性地高效解决电感器各竞争目标（如品质因数与所占面积）之间的优化折中问题。
This algorithm can globally and efficiently solve the tradeoffs between the inductor competing objectives, such as the quality factor and the area.
针对现有适用于图像的数字水印对信号处理和几何失真比较敏感的问题，论文首先提出一种稳健的数字图像水印算法。
Many digital watermarks now available for images are sensitive to signal processing and geometric distortions, a robust digital image watermarking algorithm is proposed.
针对这一问题，本文提出了一种基于边缘优化的几何体信息反走样算法。
To solve this problem, this paper presents a geometric information anti-aliasing algorithm based on edge optimization.
为了有效地解决不存在明确对应关系的点云配准问题，提出了一种基于点云几何特征的配准算法。
Aiming at the problem of point clouds registration without prior information on transformation, a novel registration algorithm is proposed based on geometric properties of point clouds.
从工程实际出发，分析了现有的几何约束求解方法中存在的问题，提出了一种新的二维全约束优化算法。
Based on analyzing the merits and faults in the geometric constraint satisfaction algorithm for the present, this article puts forward a new optimal algorithm for 2d full constraint.
并对其生成的表面几何模型所包含三角面片数量巨大的问题，提出一种快速有效的三角形边收缩算法进行网格简化，提高了表面模型的绘制速度。
Because 3D surface model contains huge number of triangles, a mesh simplification algorithm based on triangle edges shrinkages is presented in this paper to speed up the rendering in real time.
该算法使得作为参数化技术和变量化技术的核心问题：几何约束求解的研究更具有实际意义。
There is more practical significance for the research of geometric constraint solving, which is the core of parametric technology and variable technology.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
平面点集的(欧几里德)最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题。
The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design.
应用推荐