1) error-bounded polygonal approximation
误差约束多边形近似
2) error of reduct approximation
近似约简误差
3) polygon approximation
多边形近似
1.
The problem of polygon approximation was formulated as one of minimizing cost function.
将曲线多边形近似问题转换为最小化代价函数的问题,利用模拟退火算法对其求解最优解,并采用启发式方法将曲线的局部特征作为先验知识引入退火过程加速其收敛。
2.
After filling in the edge pixels and eliminating image disturbances, a fast polygon approximation algorithm was implemented to get the polygon of the target with fixed angles for recognition.
提出了改进的多阈值八邻域像素比较边线检测算法，对得到的边缘像素进行填充，并在跟踪过程中消除轮廓上的短校及图像干扰，最后采用快速多边形近似算法，用多边形顶角及目标形状因子作为特征对目标进行识别。
3.
The object contour issplit into curve segments by a coarse-to-fine polygon approximation algorithm and the mo-ment invariants of each segment are extracted as the feature vector.
该方法利用多边形近似方法将目标轮廓分段，抽取目标轮廓每一小段的不变矩作特征，利用动态规划技术在段间距离表中寻找最佳路径，确定所有的匹配对，这些匹配对序列构成了目标与模型的局部匹配，可从局部匹配中计算匹配可信度。
4) polygonal approximation
多边形近似
1.
A novel split-and-merge method with ranking selection(RSM) is proposed for the polygonal approximation of curves.
将遗传算法的排序选择策略引入到传统的拆分与合并算法,提出一种基于排序选择策略的拆分与合并算法(RSM)来求解平面数字曲线的多边形近似,解决了传统的拆分与合并算法对初始解的依赖问题。
2.
A new polygonal approximation approach based on the Binary QPSO was also presented,having solved the restriction of the search bound in BPSO.
用二进制具有量子行为的粒子群算法求解平面数字曲线的多边形近似,解决了传统BPSO算法中粒子搜索范围受限的问题。
3.
First the tumor area is calculated by polygonal approximation, some value of area are approximated by Tchebyshev multinomial algorithm to get the expression about the change of area, then the volume of tumor is obtained by integral in the CT scope which contains the tumor.
首先对分割得到的肿瘤区域采用多边形近似法计算肿瘤面积,并通过采样的部分面积数据进行切比雪夫多项式最小二乘拟合,获得反映肿瘤面积变化规律的多项式,将多项式在包含肿瘤的切片范围进行积分计算肿瘤体积,在较少的数据量条件下提高了测量的精度。
5) constrained polygon
约束多边形
补充资料：凹多边形
Image:11534686683212413.jpg
凹多边形
把一个各边不自交的多边形任意一边向两方无限延长成为一直线，如果多边形的其他各边不在此直线的同旁，那么这个多边形就叫做凹多边形。
凹多边形的内角和的解，其实我们可以通过（n-2）·180来计算。实际上是把大于平角的角划分为两个角（如图）
说明：补充资料仅用于学习参考，请勿用于其它任何用途。