摘要
解决了由直线和圆弧构成的平面轮廓精确重构问题,满足轮廓各段之间位置连续以及相切条件。在正确识别角点、切点等特征点的基础上,提出了约束最小二乘算法,可精确求解带边界约束圆弧的重构问题。将圆弧边界约束条件分为5种类型:单点约束、双点约束、单切矢约束、单点单切矢约束和双切矢约束。针对每种类型给出了具体的计算公式。详细描述了轮廓精确重构的算法流程,可实现在全局误差控制下的精确重构,最后给出了运行实例,验证了算法的有效性。
Accurate reconstruction of planar contour mixed with straight lines and arcs is achieved with position or tangent continuity. Based on segmentation and recognition technology for planar contour, constraint least square (CLS) algorithm is proposed to reconstruct arcs with boundary constraints. CLS is realized under the situation of five types of boundary constraints: single comer point, double comer points, single tangent point, single comer point, single tangent point and double tangent points. To avoid accumulating error caused by reconstruction with boundary constraints, an optimized algorithm is discussed to control the global error. Some examples are presented at last.
出处
《工程图学学报》
CSCD
北大核心
2007年第5期43-48,共6页
Journal of Engineering Graphics
关键词
计算机应用
轮廓重构
约束最小二乘
圆弧
computer application
contour reconstruction
constraint least square
arc