基于MATLAB的最大误差双圆弧逼近曲线的算法及实现

This paper analysis geometrical relationship of tangent arc and curve in different radius, and discusses the algorithm approximating curve in permission tolerance of continuous tangent arc, which can minimize theoretically the number of arc approximating segments and ensure smooth link. Joining opti...

Full description

Saved in:
Bibliographic Details
Main Authors: 丁克会, 席平原
Format: Article
Language:zho
Published: Editorial Office of Journal of Mechanical Transmission 2007-01-01
Series:Jixie chuandong
Online Access:http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2007.06.032
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850154153869836288
author 丁克会
席平原
author_facet 丁克会
席平原
author_sort 丁克会
collection DOAJ
description This paper analysis geometrical relationship of tangent arc and curve in different radius, and discusses the algorithm approximating curve in permission tolerance of continuous tangent arc, which can minimize theoretically the number of arc approximating segments and ensure smooth link. Joining optimization with linear search,the nodes are solved by programming in Matlab software. Therefore the algorithm is more simple and reliable, and the number of approximating segments is fewer, thus programming runs more rapidly and efficiently.
format Article
id doaj-art-0dc67bbec7514826aed0e978e35e8feb
institution OA Journals
issn 1004-2539
language zho
publishDate 2007-01-01
publisher Editorial Office of Journal of Mechanical Transmission
record_format Article
series Jixie chuandong
spelling doaj-art-0dc67bbec7514826aed0e978e35e8feb2025-08-20T02:25:28ZzhoEditorial Office of Journal of Mechanical TransmissionJixie chuandong1004-25392007-01-015759+11688667132基于MATLAB的最大误差双圆弧逼近曲线的算法及实现丁克会席平原This paper analysis geometrical relationship of tangent arc and curve in different radius, and discusses the algorithm approximating curve in permission tolerance of continuous tangent arc, which can minimize theoretically the number of arc approximating segments and ensure smooth link. Joining optimization with linear search,the nodes are solved by programming in Matlab software. Therefore the algorithm is more simple and reliable, and the number of approximating segments is fewer, thus programming runs more rapidly and efficiently.http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2007.06.032
spellingShingle 丁克会
席平原
基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
Jixie chuandong
title 基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
title_full 基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
title_fullStr 基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
title_full_unstemmed 基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
title_short 基于MATLAB的最大误差双圆弧逼近曲线的算法及实现
title_sort 基于matlab的最大误差双圆弧逼近曲线的算法及实现
url http://www.jxcd.net.cn/thesisDetails#10.16578/j.issn.1004.2539.2007.06.032
work_keys_str_mv AT dīngkèhuì jīyúmatlabdezuìdàwùchàshuāngyuánhúbījìnqūxiàndesuànfǎjíshíxiàn
AT xípíngyuán jīyúmatlabdezuìdàwùchàshuāngyuánhúbījìnqūxiàndesuànfǎjíshíxiàn