Cubic Polynomial Curves with a Shape Parameter
|
|
- Bertina Underwood
- 6 years ago
- Views:
Transcription
1 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad Computatioal Sciece Zheiag Uiversity City College Huzhou Street Hagzhou 005 EOLE S REUBLIC OF CHINA Abstract: A class of cubic polyomial bledig fuctios with a shape parameter is preseted. It is a extesio of cubic uiform B-splie basis fuctios. iecewise polyomial curves with a shape parameter are costructed from these bledig fuctios. The geerated curves have secod geometric cotiuity for ay fixed shape parameter ad have the same termial properties as the cubic uiform B-splie curves. If the value of the shape parameter is chaged the approachig degree of the curves to their cotrol polygo is adusted accordigly ad the curves are maipulated to approximate the cubic uiform B-splie curve from its both sides. I compariso with the existig results the degree of bledig fuctios is lower ad the domai of the shape parameter is larger i this paper. A ew method usig cubic polyomial curves with a shape parameter is also proposed to solve iterpolatio problem without solvig global systems of equatios. Fially some computig examples of the curve desig are also give. Key-Words: Bledig fuctio Shape parameter GC cotiuous Cubic splie Sigular Itroductio As we all ow polyomial B-splie curves especially quadratic ad cubic B-splie curves are widely used i computer aided geometric desig (CAGD). iecewise cotiuous curves with four cotrol poits for each curve segmet are flexible ad ca be used coveietly []. To improve the shape of a curve or the extet which a curve approaches its cotrol polygo the method of costructig curves by usig tesio parameter was preseted i CAGD [-4]. The weights of ratioal Bézier curves ad ratioal B-splie curves have the fuctio to adust the shapes of curves [5]. The shapes of some other high-order ratioal curves ca also be adusted to meet differet eeds [7]. It is good to provide a more utilizable method of geeratig curves with a shape parameter. A C-B splie curve [8] is oe of the curves with a shape parameter ad its basis fuctios cotai triagle fuctios. The shape parameter is represeted as triagle fuctios but usig triagle fuctios is ot as easy as usig polyomial fuctios. Whe values of the shape parameter are chaged C-B splie curves are away from the cotrol polygo. Quadratic ad cubic trigoometric polyomial curves with a shape parameter were proposed successively [90]. The rage of the shape parameter is the iterval[ ]. Aother method of geeratig a cubic uiform B-splie curve with a shape parameter was itroduced []. The degree of its four bledig fuctios is 4 ad the bledig fuctios are ot basis fuctios. The parameter value ca chage o the iterval[ 8]. The curve geerated is C cotiuous but it ca't approximate its cotrol polygo arbitrarily. The method was also geeralized to th( ) order uiform B-splie curve case. Aalogously to the cubic B-splie curves the purpose of this paper is to preset practical piecewise polyomial curves. The method of costructig a cubic polyomial curve with a shape parameter is obtaied ad the degree of its four bledig fuctios is. The value of its shape parameter ca chage o the iterval[ 8 + ). The curve geerated by this method is GC cotiuous ad it ca approximate its cotrol polygo arbitrarily by icreasig the value of its shape parameter. The curve is a extesio of a cubic uiform B-splie curve. It has some good properties as a cubic uiform B-splie curve does. This paper also presets ew iterpolatio method that ca produce C cotiuous cubic polyomial curves with a shape parameter without solvig global systems of equatios [-4] while providig slacess cotrol capabilities. With the low-degree polyomials ad direct computatio of cotrol vertices the method is computatioally simple ad thus useful for iteractive iterpolatio shape desig ad computer graphics applicatios.
2 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) The paper is orgaized as follows. I Sectio the bledig fuctios are proposed ad the properties are described. I Sectio the cubic polyomial curve with a shape parameter is give. Ope ad closed piecewise cubic polyomial curves are described. The approximatio of the GC cotiuous polyomial curve to a cubic B- splie curve ad to the give cotrol polygo are show i Sectio 4. A ew iterpolatio method is also described i Sectio 4. Some coclusios ca be draw i Sectio 5. Cubic basis fuctios with a shape parameter Defiitio. Supposed t [0] λ R the associated bledig fuctios are defied to be the followig fuctios: φ0(; t λ) = ( t) + λ φ (; t λ) = ( + λ) t ( 4+ λ) t λ + λ φ(; t λ) = ( + λ) t + ( + λ) t + t+ + λ φ(; t λ) = t + λ t [0]. Theorem. The bledig fuctios have the followig properties: φ (; t λ) = φ ( t; λ) φ (; t λ) = φ ( t; λ). () 0 () = 0 φ (; t λ) = t [0] λ 8. () φ ( t; λ) 0( = 0 ) t [0] λ 8. (4) φ0 (; t λ) B0 () t φ(; t λ) 8+ λ 8+ λ 4 B() t = φ(; t λ) + λ 4 8+ λ 8+ λ B () t φ (; t λ) B () t ( ) B = t t ( = 0) are Berstei polyomial basis fuctios. roof: (i) roperty () () ad (4) are straightforward. (ii)roperty () is proved accordig to (4). For ay φ (; t λ ) ca be represeted as covex liear combiatios of B i ()( t i = 0) ad the combiatio coefficiets are o-egative so φ (; t λ )( = 0) are o-egative. The proof is completed. If λ = 0 φ ( t;0)( = 0) t [0] are the basis fuctios of cubic uiform B-splie curve o the iterval [0]. The bledig fuctios are the geeralized basis fuctios of cubic uiform B- splie. Fig. shows the images of the basis fuctios for differet shape parameters. Fig. The image of the basis fuctios with differet shape parameters λ Cubic splie curve with a shape parameter Defiitio. Give cotrol poits i ( i = 0 L ) ( ) a ot vector t0 < t < L < t + ad a parameter λ( λ 4 ) the for ay t [ t t + ] = 4 L the curve segmet of polyomial is defied as follows: t t (; t λ ) φ i i ;. i 0 t t λ C = + = + The piecewise cubic polyomial curve is defied as follows: C(; t λ) = C (; t λ ) t [ t t+ ] = 4 L The curve is a piecewise cubic polyomial curve with a shape parameter defied o the iterval[ t t + ] ad it is geeralized from the cubic uiform B-splie curve. For ay t [ t t+ ) = 4 L the curve segmet lies i the covex hull H of. The
3 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) total curve lies i U = H. The shape of ca be adusted whe the parameter value λ is chaged. For t [ t t+ ) = 4 L C (; t λ ) ca be trasformed ito a Bézier curve with its variable t t parameter u = ad its cotrol poits are t+ t b b b b where b ( λ ) ( 8+ λ ) + 4 ( λ ) ( λ ) b = b + λ b similar properties o the edpoit locatio ad edpoit taget vector. If let = 0 ad + = ad 0L + be the cotrol polygo of the curve the 0 ad are its start ad termial poits respectively. ( 0) ad + λ ( ) are its taget vectors at 0 ad + λ respectively. If let = 0 + = + = ad 0L + + be the cotrol polygo of the curve the the curve is a closed curve. Fig. depicts ope ad closed cubic polyomial curves for λ = 0. So de Castelau corer cuttig algorithm of a Bézier curve ca be applied to the computatio of the curve for speed ad stable computatio. Theorem. The curve has d geometric cotiuity i.e. it is a GC cotiuous curve. roof: Let h = t+ t = 4 L. Straightforward computatio is show as: C ( t + ; λ) = + ( 8+ λ) + + λ C( t+ ; λ) = ( 8 λ) λ C ( ; ) ( ) ( ) t+ λ = h + λ C ( t ; λ) = ( ) ( ) + λ + h C ( t + ; λ) = ( 4+ λ) + ( + λ) ( + λ ) h + λ 4+ λ +. λ + C ( t+ ; λ) = h ( ) ( ) ( ) For = 45 L the followig ca be obtaied C( t + ; λ) = C( t ; λ) h C t + = t ( ; λ) C ( ; λ) h h h C ( t+ ; λ) = C ( t ; λ) + λ C ( t ; ). λ h h Accordig to the proof of Theorem the curve ad the cubic uiform B-splie curve have Fig. Ope ad closed GC cotiuous cubic splie curves with λ = 0 I Fig. the curve gradually approximates its cotrol polygo if the shape parameter λ gradually icreases. The property is
4 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) commo. I fact if t is fixed φ () t ad φ () t 0 are mootoe decreasig with respect to λ so for ay C (; t λ ) the weights of poits ad become smaller if λ becomes larger. The curve segmet C (; t λ ) approximates the lie segmet because the weights of poits icrease. ad Fig. Ope GC cotiuous cubic splie curves iterpolatig edpoits with differet λ 4 Applicatio of cubic splie curve with a shape parameter λ ca be used as a shape parameter i order to costruct curves locatig at differet positios. The rage for the shape parameter i this paper is the iterval [ 8 + ). I Refereces [] the shape parameter is the iterval [ 8]. The curves geerated by the two methods ca approximate their cotrol polygo whe the values of their shape parameter icrease. So our method has more abudat modelig fuctios tha that i Refereces []. It is fatal that the bledig fuctios costructed i Refereces [] are degree 4 ad ot basis fuctios. Fig. ad Fig. 4 show examples of curve desig. Fig.4 Ope ad closed GC cotiuous cubic splie curves with λ = (a) Usig method i Referece [] (b) Usig our method If λ [40] the curve approaches more to the cubic uiform B-splie havig the same cotrol polygo with. If λ [0 + ) the curve approaches more to the cotrol polygo of. The iterpolatig problem is cosidered i the followig. Give a set of data poits { i} R 4 our goal is to costruct a lowdegree iterpolatig polyomial curve without i= 0 solvig ay global system to fid its cotrol vertices ad its global slacess cotrolled. I order to iterpolate the two edpoits we itroduce two auxiliary data poits = 0 ad + = if the cotrol polygo is ope ( 0 ) or = ad + = if the cotrol polygo is closed ( 0 = ). The ot vector is obtaied by accumulatig chord-legth.
5 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) The cubic sigular bledig fuctio [4] is defied to be 9 t t t t t + t+ t+ t 9 tt tt t+ t t+ t S () t = t + t+ t t + t+ 9 t + t t + t+ t t+ ; t+ t t < t = L +. + It is easy to prove that S () t are sigular fuctios satisfyig that S( t) = 0 S( t+ ) = S ( t) = S ( t) = 0 S ( t+ ) = S ( t+ ) = 0. The cubicα -splie curve is defied to be Q (; t λ α ) = ( α) C( t; λ) + ( S( t) ) + S( t) α + ( 4 + λ ) + λ + S () t ( α ) + [ + ( + λ) ( + λ) ] + λ t t t = L +. + Q(; t λ α) = Q(; t λ α ) t t t+ = L + It is clear that for ay bledig factor α the resultig curve Q(; t λ α) is GC cotiuous ad Q( t; λ α) = = L +. So the costructed curve Q (; t λ α) iterpolates the data poits { i} i= 0. For the purpose of practical shape modelig we shall restrict α [0] ad call these curves the stadard α cubic splie curve with a shape parameter λ. If α = 0 the α cubic splie curve is reduced to the cubic splie curve. The bledig factor α ca be used to cotrol the slacess of the α cubic splie curve Q (; t λ α). Note that chagig the bledig factor α does ot affect the cotiuity of Q(; t λ α) ad the iterpolatio features at the data poits. Thus there are two parameters that ca ifluece the shape of the cubic splie curve. Fig.5 ad Fig. describe ope ad closed α cubic splie curves with two differet parameters. Fig.5 Ope curves iterpolatig data poits with differet shape parameters ad bledig factors
6 roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April (pp5-70) Fig. Closed curves iterpolatig data poits with differet shape parameters ad bledig factors 5 Coclusios I this paper a type of cubic piecewise polyomial curve with a shape parameter is preseted. The cubic uiform B-splie curve is its special case ad this cubic curve ca locate differet places o both sides of the cubic uiform B-splie curve. By chagig the value of the shape parameter we ca adust the approachig degree of the curves to their cotrol polygo ad maipulate the curves to approximate the cubic uiform B-splie curves from both sides. The curve is GC cotiuous ad it ca arbitrarily approximate its cotrol polygo by icreasig the value of its shape parameter. It ca also be used to solve a iterpolatio problem. The costructed α cubic splie curve iterpolates the give data poits. Some computig examples show that the method of costructig curves has importat use value. Refereces: [] J. Hosche D. Lasser Fudametals of Computer Aided Geometric Desig Wellesley MA (traslated by L.L. Schumaer) 99. [] B. A. Barsy Computer graphics ad geometric modellig usig Beta-splies Spriger-Verlag Hei-delberg 988. [] J. A. Gregory M. Sarfraz A ratioal cubic splie with tesio Computer Aided Geometric Desig Vol pp.-. [4] B. Joe Multiple-ot ad ratioal cubic Betasplies ACM Trasactios o Graphics Vol.8 No. 989 pp [5] L. iegl W. Tiller The NURBS Boo Spriger New Yor 995. [] T. N. T. Goodma Costructig piecewise ratioal curves with Freet frame cotiuity Computer Aided Geometric Desig Vol pp.5-. [7] B. Joe Quartic Beta-splies ACM Trasactios o Graphics Vol.9 No. 990 pp.0-7. [8] Jiwe Zhag C-curves: A extesio of cubic curves Computer Aided Geometric Desig Vol. No. 99 pp [9] Xuli Ha Quadratic trigoometric polyomial curves with a shape parameter Computer Aided Geometric Desig Vol.9 No.7 00 pp [0] Xuli Ha Cubic trigoometric polyomial curves with a shape parameter Computer Aided Geometric Desig Vol. No. 004 pp [] Xuli Ha Shegu Liu A extesio of the cubic uiform B-splie curves Joural of Computer-Aided Desig & Computer Graphics Vol.5 No.5 00 pp [] B. A. Barsy D.. Greeberg Determiig a set of B-splie cotrol vertices to geerate a iterpolatig surface Computer Graph ad Image rocess Vol.4 No. 980 pp.0-. [] K. F. Loe α -B-splie: a liear sigular bledig B-splie. The Visual Computer Vol. 99 pp.8-5. [4] C.L. Tai G.J. Wag Iterpolatio with slacess ad cotiuity cotrol ad covexitypreservatio usig sigular bledig. Joural of Computatioal & Applied Mathematics Vol.7 No. 004 pp.7-.
Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
More informationConvex hull ( 凸殻 ) property
Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull
More informationReading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.
Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for
More informationReading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:
Readig Recommeded: Stollitz, DeRose, ad Salesi. Wavelets for Computer Graphics: Theory ad Applicatios, 996, sectio 6.-6.3, 0., A.5. Subdivisio curves ad surfaces Note: there is a error i Stollitz, et al.,
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationImproved triangular subdivision schemes 1
Improved triagular subdivisio schemes Hartmut Prautzsch 2 Georg Umlauf 3 Faultät für Iformati, Uiversität Karlsruhe, D-762 Karlsruhe, Germay E-mail: 2 prau@ira.ua.de 3 umlauf@ira.ua.de Abstract I this
More informationExtended Space Mapping with Bézier Patches and Volumes
Eteded Space Mappig with Béier Patches ad Volumes Bejami Schmitt 1, 2 Aleader Pasko 1 Vladimir Savcheko 1 Abstract We eplore a geeral eteded space mappig as a framework for trasformig a hypersurface i
More informationStudy on Bezier Curve Variable Step-length Algorithm
Available olie at www.sciecedirect.com Physics Procedia 25 (2012 ) 1781 1786 2012 Iteratioal Coferece o Solid State Devices ad Materials Sciece Study o Bezier Curve Variable Step-legth Algorithm Guorog
More information2D Isogeometric Shape Optimization considering both control point positions and weights as design variables
1 th World Cogress o tructural ad Multidiscipliary Optimizatio May 19-24, 213, Orlado, Florida, UA 2D Isogeometric hape Optimizatio cosiderig both cotrol poit positios ad weights as desig variables Yeo-Ul
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationSmooth Spline Surfaces over Irregular Meshes
Smooth Splie Surfaces over Irregular Meshes Charles Loop Apple Computer, Ic. Abstract A algorithm for creatig smooth splie surfaces over irregular meshes is preseted. The algorithm is a geeralizatio of
More informationLecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10
Lecture 24: Bezier Curves ad Surfaces thou shalt be ear uto me Geesis 45:0. Iterpolatio ad Approximatio Freeform curves ad surfaces are smooth shapes ofte describig ma-made objects. The hood of a car,
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationMath 10C Long Range Plans
Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationG 1 Interpolation of arbitrary meshes with Bézier patches
Master s Degree i Applied Mathematics Supervised by Stefaie Hahma March 5th - July 5th 007 G Iterpolatio of arbitrary meshes with Bézier patches Jea Kutzma Lab. B.P. 53 3804 Greoble Cedex 9 Cotets Ackowledgmets
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationComputing the minimum distance between two Bézier curves
Computig the miimum distace betwee two Bézier curves Xiao-Diao Che, Liqiag Che, Yigag Wag, Gag Xu, Ju-Hai Yog, Jea-Claude Paul To cite this versio: Xiao-Diao Che, Liqiag Che, Yigag Wag, Gag Xu, Ju-Hai
More informationSouth Slave Divisional Education Council. Math 10C
South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve
More informationHARTMUT PRAUTZSCH and GEORG UMLAUF. Fakultat fur Informatik, Universitat Karlsruhe. [prau/umlauf
A G AND A G SUBDIVISION SCHEME FOR TRIANGULAR NETS HARTMUT PRAUTZSCH ad GEORG UMLAUF Fakultat fur Iformatik, Uiversitat Karlsruhe D-768 Karlsruhe, Germay E-mail: [prau/umlauf ]@ira.uka.de I this article
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
More informationABOUT A CONSTRUCTION PROBLEM
INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationAn effective third-order local fitting patch and its application
IEEE INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS (SMI) 9 A effective third-order local fittig patch ad its applicatio Zhog Li,,3, Bria Barsky 3, Xiaogag Ji Departmet of Mathematics ad Sciece,
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationLoop Subdivision Surface Based Progressive Interpolation
Cheg FH (F), Fa FT, Lai SH et al Loop subdivisio surface based progressive iterpolatio JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 24(1): 39 46 Ja 2009 Loop Subdivisio Surface Based Progressive Iterpolatio
More informationfreeform: A Tool for Teaching the Mathematics of Curves and Surfaces
257 freeform: A Tool for Teachig the Mathematics of Curves ad Surfaces James R. Miller Uiversity of Kasas, jrmiller@ku.edu ABSTRACT We describe the structure ad use of a iteractive modelig ad visualizatio
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationState-space feedback 6 challenges of pole placement
State-space feedbac 6 challeges of pole placemet J Rossiter Itroductio The earlier videos itroduced the cocept of state feedbac ad demostrated that it moves the poles. x u x Kx Bu It was show that whe
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationUsing a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations
Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationAssignment Problems with fuzzy costs using Ones Assignment Method
IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationMULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ
MULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ Gdask Uiversity of Techology Narutowicza 11/12, 8-233 Gdask, Polad dejot@eti.pg.gda.pl Multibea soar records
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationRADIAL BASIS FUNCTION USE FOR THE RESTORATION OF DAMAGED IMAGES
RADIAL BASIS FUNCION USE FOR HE RESORAION OF DAMAGED IMAGES Karel Uhlir, Vaclav Skala Uiversity of West Bohemia, Uiverziti 8, 3064 Plze, Czech Republic Abstract: Key words: Radial Basis Fuctio (RBF) ca
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationPrimitive polynomials selection method for pseudo-random number generator
Joural of hysics: Coferece Series AER OEN ACCESS rimitive polyomials selectio method for pseudo-radom umber geerator To cite this article: I V Aiki ad Kh Alajjar 08 J. hys.: Cof. Ser. 944 0003 View the
More informationKernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1
Ozea Joural of Applied Scieces (), 009 Ozea Joural of Applied Scieces (), 009 ISSN 943-49 009 Ozea Publicatio Kerel Smoothig Fuctio ad Choosig Badwidth for No-Parametric Regressio Methods Murat Kayri ad
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationGEORG UMLAUF. Abstract. Tools for the analysis of generalized triangular box spline subdivision schemes are
ANALYZING THE CHARACTERISTIC MAP OF TRIANGULAR SUBDIVISION SCHEMES GEORG UMLAUF Abstract. Tools for the aalysis of geeralized triagular box splie subdivisio schemes are developed. For the rst time the
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationThe Extended Weibull Geometric Family
The Exteded Weibull Geometric Family Giovaa Oliveira Silva 1 Gauss M. Cordeiro 2 Edwi M. M. Ortega 3 1 Itroductio The literature o Weibull models is vast, disjoited, ad scattered across may differet jourals.
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationThe identification of key quality characteristics based on FAHP
Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP
More informationMapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System
Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationPolymorph: Morphing Among Multiple Images
Feature Article Polymorph: Morphig Amog Multiple Images Image metamorphosis has prove to be a powerful visual effects tool. May breathtakig examples ow appear i film ad televisio, depictig the fluid trasformatio
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More information35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD
N. J. DeMoes et al., It. J. Comp. Meth. ad Exp. Meas., Vol. 0, No. 0 (08) 3 35 YEARS OF ADVANCEMENTS WITH THE COMPLEX VARIABLE BOUNDARY ELEMENT METHOD Noah J. DeMoes, Gabriel T. Ba, Bryce D. Wilkis, Theodore
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationTexture Mapping. Jian Huang. This set of slides references the ones used at Ohio State for instruction.
Texture Mappig Jia Huag This set of slides refereces the oes used at Ohio State for istructio. Ca you do this What Dreams May Come Texture Mappig Of course, oe ca model the exact micro-geometry + material
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationSUBDIVISION surfaces are becoming more and more popular
IEEE-TVCG RGB Subdivisio Erico Puppo, Member, IEEE, ad Daiele Paozzo Abstract We itroduce the RGB Subdivisio: a adaptive subdivisio scheme for triagle meshes, which is based o the iterative applicatio
More information