Accurate and Efficient Algorithm for the Closest Point on a Parametric Curve
文献类型：会议论文
| 作者 | Xu JT(徐金亭); Liu WJ(刘伟军) ; Bian HY(卞宏友); Li L(李论)
|
| 出版日期 | 2008 |
| 会议名称 | 2008 International Conference on Computer Science and Software Engineering |
| 会议日期 | December 12-14, 2008 |
| 会议地点 | Wuhan, China |
| 页码 | 1000-1002 |
| 中文摘要 | This paper presents an accurate and efficient method for computation of the closest point on parametric curves. This problem is firstly formulated in terms of solution of a polynomial equation expressed in Bernstein basis, and then based on subdivision relying on the convex hull property of Bezier curve and the recursive bintree decomposition on the parameter domain, a novel solution method is proposed. The computation of closest point is shown to be equivalent to the geometrically intuitive intersection of a curve with the parameter line. Finally, by comparing the distances between the test point and the candidate points, the closest point is found. An example illustrates the feasibility of this method. |
| 收录类别 | EI |
| 产权排序 | 1 |
| 会议主办者 | IEEE |
| 会议录 | 2008 International Conference on Computer Science and Software Engineering
 |
| 会议录出版者 | IEEE |
| 会议录出版地 | New York |
| 语种 | 英语 |
| 源URL | [http://ir.sia.cn/handle/173321/8532]  |
| 专题 | 沈阳自动化研究所_机器人学研究室 |
| 推荐引用方式 GB/T 7714 | Xu JT,Liu WJ,Bian HY,et al. Accurate and Efficient Algorithm for the Closest Point on a Parametric Curve[C]. 见:2008 International Conference on Computer Science and Software Engineering. Wuhan, China. December 12-14, 2008. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。