提出一种新的多边形逼近算法。
文中提出了一种基于面积误差的多边形逼近算法。
本文提出一种新的基于多边形逼近算法的粒子群优化算法。
This paper presents a new polygonal approximation approach based on the particle swarm optimization (PSO) algorithm.
每个粒子被描绘成一个二元向量相当于一个候选人的多边形逼近问题的解决方案。
Each particle represented as a binary vector corresponds to a candidate solution to the polygonal approximation problem.
给出这种新样条曲线的细分公式并证明它们有变差缩减性质和细分控制多边形逼近性质。
Subdivision formula for these new kind curves is given. Further, the variation dimishing properties and the convergence of the subdivision is proved.
给出了任意图形的多边形逼近、非凸图形的凸组合、利用NFP做碰撞检测和扫描线搜索图形间缝隙等方法。
The paper gives out a method to combine non-convex figures into a convex one, a method to get bumping region by using NFP, and a scanning-line method to search the gaps among adjacent figures;
利用构造出的多边形有理插值，采用凸多边形逼近任意凸域，通过区域边界温度离散值，插值近似区域内的温度场分布。
A convex domain is approached by a convex polygon, and the approximated temperature distribution within the domain can be interpolated with the temperature data at the boundaries of the domain.
鉴于这种情况，我们先使用低通滤波对轮廓曲线作光顺处理，随后再采用基于面积误差的多边形逼近法对曲线作逼近处理。
And they are often distorted. First, a low passed filter is used to smooth the contour. And a polygon approximating method based on area error is used to approximate the contour.
景物的特征点抽取是模式识别及计算机视觉中的一个重要问题，已出现的多种检测特征点的方法中主要有角检测法和多边形逼近法。
Detecting dominant points is an important subject in pattern recognition and computer vision. Corner detection and polygonal approximation are two major approaches for dominant point detection.
由于曲线边界可以由小线段组成的多边形来逼近，所以通过本算法，我们还可以实现任何边界区域间的布尔操作。
We know that curves can be approached by mini line-segments, so the Boolean operations between almost all regions can be implemented by this algorithm.
当形状参数增大时，曲线能连续逼近控制多边形。
With increasing of the shape parameters the curve can well approximate the control polygon.
提出了一种基于遗传算法的数字曲线多边形改进逼近方法。
An improved approach to polygonal approximation of regular digital curves based on GA algorithm is presented.
采用了封闭多边形矢量法和杆长逼近法相结合的综合分析方法对III级组进行了运动学分析。
The generalized analysis method to the III level of groups are carried on with the closed loop method and approximating method.
贝赛尔曲线的拆分是指将贝赛尔曲线分解成逼近的多边形。
Bezier curve is split down into the Bezier curve approximation polygon.
该算法对规则曲线多边形简化逼近前后的形状特征的保持具有较好的效果。
The algorithm has better results for preserving shape features of regular curves of polygon after simplification.
该算法对规则曲线多边形简化逼近前后的形状特征的保持具有较好的效果。
The algorithm has better results for preserving shape features of regular curves of polygon after simplification.
应用推荐