Approximate Conversion of Functions -- Using Conic Spline
碩士 === 元智大學 === 電機與資訊工程研究所 === 82 === Often plotting or conversion packages do not use high- resolution output devices efficiently. Where such packages use very large point file to describe a plot. In this thesis, we will propose a...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Online Access: | http://ndltd.ncl.edu.tw/handle/38387169364351471101 |
id |
ndltd-TW-082YZU00446036 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-082YZU004460362016-02-08T04:06:33Z http://ndltd.ncl.edu.tw/handle/38387169364351471101 Approximate Conversion of Functions -- Using Conic Spline 使用圓錐樣條曲線做函數近似轉換之研究 Hsu Chie Liang 徐志亮 碩士 元智大學 電機與資訊工程研究所 82 Often plotting or conversion packages do not use high- resolution output devices efficiently. Where such packages use very large point file to describe a plot. In this thesis, we will propose a new method which produces a conic spline to approximate the parametric function which could be represented by R(t) = [ X(t),Y(t) ]. We choose the knot in the inflection point which makes the splited segments as less as possible. And we select the conic spline as the primitive curve, because it's simple, fast in computing time, and flexible. The most important problem in this thesis is to find the accurate value of cusps and inflection points to be the knots. We'll discuss that in the approximte conversion steps. Jenn-Hua Lee;Ji-Cherng Lin 李振華;林基成 學位論文 ; thesis 37 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 電機與資訊工程研究所 === 82 === Often plotting or conversion packages do not use high-
resolution output devices efficiently. Where such packages use
very large point file to describe a plot. In this thesis, we
will propose a new method which produces a conic spline to
approximate the parametric function which could be represented
by R(t) = [ X(t),Y(t) ]. We choose the knot in the inflection
point which makes the splited segments as less as possible. And
we select the conic spline as the primitive curve, because it's
simple, fast in computing time, and flexible. The most
important problem in this thesis is to find the accurate value
of cusps and inflection points to be the knots. We'll discuss
that in the approximte conversion steps.
|
author2 |
Jenn-Hua Lee;Ji-Cherng Lin |
author_facet |
Jenn-Hua Lee;Ji-Cherng Lin Hsu Chie Liang 徐志亮 |
author |
Hsu Chie Liang 徐志亮 |
spellingShingle |
Hsu Chie Liang 徐志亮 Approximate Conversion of Functions -- Using Conic Spline |
author_sort |
Hsu Chie Liang |
title |
Approximate Conversion of Functions -- Using Conic Spline |
title_short |
Approximate Conversion of Functions -- Using Conic Spline |
title_full |
Approximate Conversion of Functions -- Using Conic Spline |
title_fullStr |
Approximate Conversion of Functions -- Using Conic Spline |
title_full_unstemmed |
Approximate Conversion of Functions -- Using Conic Spline |
title_sort |
approximate conversion of functions -- using conic spline |
url |
http://ndltd.ncl.edu.tw/handle/38387169364351471101 |
work_keys_str_mv |
AT hsuchieliang approximateconversionoffunctionsusingconicspline AT xúzhìliàng approximateconversionoffunctionsusingconicspline AT hsuchieliang shǐyòngyuánzhuīyàngtiáoqūxiànzuòhánshùjìnshìzhuǎnhuànzhīyánjiū AT xúzhìliàng shǐyòngyuánzhuīyàngtiáoqūxiànzuòhánshùjìnshìzhuǎnhuànzhīyánjiū |
_version_ |
1718182891686461440 |