Bicubic Polar Subdivision

Size: px
Start display at page:

Download "Bicubic Polar Subdivision"

Transcription

1 Bicubic Polar Subdivisio K. Karčiauskas Vilius Uiversity ad J. Peters Uiversity of Florida We describe ad aalyze a subdivisio scheme that geeralizes bicubic splie subdivisio to cotrol ets with polar structure. Such cotrol ets appear aturally for surfaces with the combiatorial structure of objects of revolutio ad at poits of high valece i subdivisio meshes. The resultig surfaces are C 2 except at a fiite umber of isolated poits where the surface is C ad the curvature is bouded. Categories ad Subject Descriptors: I.3.5 []: Computatioal Geometry ad Object Modelig; J.6 []: Computer-Aided Egieerig Geeral Terms: Algorithms Additioal Key Words ad Phrases: Subdivisio, polar layout, polar et, bicubic, Catmull-Clark, curvature cotiuity. INTRODUCTION Polar cotrol ets (Figure ) capture the combiatorial structure of objects of revolutio ad are therefore more atural at poits of high valece (see e.g. Figure 2) tha the all-quads layout favored by Catmull-Clark subdivisio [Catmull ad Clark 978]. Correspodigly, we defie ad aalyze i the followig a biary subdivisio scheme that, just like Catmull-Clark subdivisio, geeralizes the refiemet rules of uiform cubic splies but for the layout of a polar et. Formally, a cotrol et without boudary is a polar et [Karčiauskas ad Peters 2007] if it cosists of extraordiary mesh odes surrouded by triagles, ad of quadrilaterals that have odes of valece four. The extraordiary mesh odes eed oly be separated by oe layer of odes of valece four as illustrated i Figure 7, left. Applyig quad-tri subdivisio [Stam ad Loop 2003; Peters ad Shiue 2004; Schaefer ad Warre 2005] to a polar et is ot a good alterative, sice Loop subdivisio also i 2 c i, c i,2 radial i+ A circular Fig.. Polar cotrol et ear a extraordiary poit (left) ad its refiemet (right) uder subdivisio. The cotrol poits c ij have subscripts i idicatig (modulo the valece ) the directio ad subscripts j idicatig the radial distace to the extraordiary poit c i0. Oly the radial, ot the circular directio is refied. does ot cope well with such iput meshes (Figure 2). Polar subdivisio differs structurally from tesored uivariate schemes with sigularities, e.g. [Mori et al. 200], i that the umber of eighbors of the extraordiary poit does Permissio to make digital/hard copy of all or part of this material without fee for persoal or classroom use provided that the copies are ot made or distributed for profit or commercial advatage, the ACM copyright/server otice, the title of the publicatio, ad its date appear, ad otice is give that copyig is by permissio of the ACM, Ic. To copy otherwise, to republish, to post o servers, or to redistribute to lists requires prior specific permissio ad/or a fee. c 20YY ACM /20YY/ $5.00 ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY, Pages 0??.

2 2 K. Karčiauskas ad J. Peters Fig. 2. Wrikle removal o a Easter Islad head (valece 20). (from left to right) Catmull-Clark subdivisio, Loop subdivisio (quad facets are split), cotrol et, color-coded rigs of the polar subdivisio surface, polar subdivisio surface. ot double with each polar subdivisio step but stays fixed. Quadrilaterals i a polar et are ot split ad the cotrol et refies oly towards the extraordiary poit (Figure ). Therefore, the polar cotrol et does ot, off had, serve the fuctio of approximatig the surface ever more closely by smaller facets. However, the resultig surface as a sigle B-splie mesh growig towards the extraordiary poit, i.e. the surface does ot have the cascadig sequece of T-corers itrisic to Catmull-Clark surfaces. Sectio 4, Cotrol Nets, explais this i detail. Compared to [Karčiauskas et al. 2006], the more localized computatio of bicubic polar subdivisio results i a more localized curvature distributio. At the extraordiary poit, the curvature of surfaces geerated by bicubic polar subdivisio is oly bouded but eed ot be cotiuous while the algorithm i [Karčiauskas et al. 2006] geerates C 2 surfaces. The preset scheme has, however, the advatage of simpler rules without visibly sacrificig good shape. 2. POLAR REFINEMENT RULES Apart from the extraordiary mesh odes, the polar et defied i the itroductio, is a stadard bicubic B-splie cotrol et. For the layer of quadrilaterals adjacet to the triagles, we iterpret the triagles as degeerate quadrilaterals with oe edge collapsed. It is easy to check, for example by coversio to Bézier form, that this iterpretatio does ot result i sigularities i the quadrilateral layer. I order to map a polar et to a refied polar et, we will refie the bicubic splie et oly i the radial directio (cf. Figure ). γ i+ β γ i γ i Fig. 3. Refiemet stecils for biary polar subdivisio. As is typical for subdivisio algorithms, we eed oly explai how to refie the polar et immediately coected to extraordiary mesh odes. To obtai leadig eigevalues, 2, 2, 4, 4, 4, it suffices to have special rules oly at the extraordiary mesh ode ad its direct eighbors (Figure 3). The two regular rules are the subdivisio rules for ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

3 uivariate uiform cubic splies. The extraordiary rules have the weights := β 4, β := 2, γ k := Bicubic Polar Subdivisio 3 ( β ck + (ck )2 + 2 (ck )3), c k := cos( 2πk). () Here, we chose β = /2 to emphasize covexity at the extraordiary poit, sice this is likely the domiat sceario for polar meshes. This choice is also reasoable for saddles (Figure 9). Sectio 4, Covexity ad Valece discusses the role of β i more detail. A useful property of polar surfaces is that the valece ca be chaged by iterpretig each circular rig of coefficiets as the cotrol polygo of a cubic splie curve. To avoid a special discussio of low valeces, we uiformly isert kots i the circular splie curves ad double the valece whe {3, 4, 5}. That is, we may assume 6 i the followig. 3. PROPERTIES BY CONSTRUCTION Let c m i,j be the cotrol poit of the ith sector ad the jth layer as idicated i Figure. The cetral ode is cosidered split ito copies c m i0, each weighted by /. The the vector of cotrol poits c m := (...,c m i0,c m i,c m i2,c m i3,...) R 4 4, is refied by a subdivisio matrix with block-circulat structure: c m+ = Ac m, A := A 0 A... A A A 0... A A... A A 0 R 4 4, A 0 := 0 0 β γ , A i := that ca be block-diagoalized by Discrete Fourier Trasform Âi := the eige-aalysis is pleasatly simple. k=0 ωik 0 0 β γi A k,, i =,...,, ω l := exp( 2πl ), so that LEMMA. For geeric iput data, the limit surface of bicubic polar subdivisio is C 2 except at isolated extraordiary poits where the surface is C ad the curvature bouded. PROOF. As illustrated i Figure 4, cotrol poit layers through 5 defie two rigs of bicubic splies (Figure 4 middle). This double-rig is C 2 sice it correspods to a regular (periodic) tesor-product splie. As i Catmull-Clark subdivisio, cosecutive double-rigs joi C 2. For > 5, 2, if i {, } ( 0 0 ) ( ) ˆγ i = 4, if i {2, 2}, ad 6, if i {3, 3} Â0 = 0, if i > 3 ad i < 3. β β ,  i = 0 ˆγ i (2) The eigevalues of Â0 are, 4, 8, 0 ad the eigevalues of Âi for i =,...,, are ˆγ i := k=0 ωik γ k, 8, 0, 0. I particular, λ = ˆγ ad (λ ) 2 = λ 2 = ˆγ 2 as is required for bouded curvature. Sice the eigevector of matrix  for λ = 2 is (0,, 2, 3)t, the subdomiat eigevectors of A are the coordiates of [ ] v = (...,r3 i,r i 0,r i,r i 2,r i 3,r i+ 0,...), r i cos i 2π k := k, i =,...,, k = 0,, 2, 3. (3) si i 2π The cotrol et v defies the characteristic map (Figure 4, middle) [Reif 995], whose regularity ad ijectivity are easily verified [Peters ad Reif 998; Umlauf 999]. The eigevectors correspodig to the eigevalue /4 are from Fourier blocks 0, 2 ad 2 ad they are ot geeralized eigevectors. Explicitly, for use i Sectio 4, the ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

4 4 K. Karčiauskas ad J. Peters Fig. 4. (left) Layers 0 through 5 (geerated by oe subdivisio of layers 0 through 3) defie (middle) oe piecewise bicubic double-rig. (right) Cosecutive double-rigs joi smoothly ad, ulike Catmull-Clark subdivisio, without T-corers. eigevectors v 2k to the eigevalue 4 of Âk for Fourier idex k {0, 2} are v 20 := ( + 3b,, 7 + 3b, 6 + 6b) t, b := 4β, v 22 := (, 4, 6, 4) t. (4) Together with the curvature bouded spectrum, this implies curvature boudedess as claimed. LEMMA 2. The limit extraordiary poit is ηc 00 + ( η) c i η := i= 4( β). 3 PROOF. We choose the represetatio Ā R3+ 3+ of the subdivisio operator where we do ot replicate the cetral ode c 00 : a r... a r a c Ā 0... Ā a Ā := r := [ (...., 0, 0] γ0 0 0 ) (. a c := [ β, 3 8, Ā 0 := 0]t γi ) 0 0 Ā i := 0 0 0, i =,..., a c... Ā Ā 0 We ca directly check that the left eigevector of Ā with respect to the domiat eigevalue is β [ β +, l, l,...,l]t, l := [, 0, 0]. ( β + ) The claim follows (see [DeRose et al. 998], Appedix A) sice the etries sum to. Sice [0,, 0, 0] is a left eigevector to Â, the ormal directio at the extraordiary poit is simply ( i= cosi2π c i0) ( i= si i2π c i0). 4. DISCUSSION This sectio discusses some alterative schemes, the meaig of cotrol polyhedra ad adjustmet of valece ad covexity. Alterative Schemes. The bicubic polar subdivisio algorithm has special rules for both the ew cetral ode ad its direct eighbors. Choosig symmetric special rules oly for the cetral ode does ot yield appropriate degrees of freedom for smoothess. Specifically, forcig a double subdomiat eigevalue by tuig oly the rules for the cetral ode, leads to oe sigle subdomiat eigevector for > 3; oly for = 3, do there exist rules to geerate C surfaces with a spectrum suitable for bouded curvature. So, a direct polar aalogue of Catmull-Clark subdivisio fails ad the questio arises whether a terary polar subdivisio scheme, aalogous to [Loop 2002], is advatageous. ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY

5 Bicubic Polar Subdivisio 5 β γ i+ γ i γ i Fig. 5. Refiemet stecils for a terary polar subdivisio (splittig ito three i the radial directio) where β := 38 8, := β 9, γ k := 4 8 `5 + 2c k ` + c k 2. We derived such a variat for compariso (see Figure 5). The weights γ k are o-egative ad the scheme satisfies all the costraits o the leadig eigevalues (, 3, 3, 9, 9, 9 ) ad eigevectors for curvature boudedess. However, the resultig surfaces did ot look better tha those of the proposed biary subdivisio. Cotrol Nets ad Surface Rigs. Subdivisio surfaces ca either be viewed as refiig a cotrol et or as geeratig a sequece of surface rigs covergig to the extraordiary poit [Reif 995]. The first serves ituitio if the cotrol et outlies the shape, the secod is preferred for exact evaluatio, computig ad aalysis. Both Catmull-Clark subdivisio ad polar subdivisio admit the two views but differ i their bias. To see this, defie a T-corer to be the locatio where a edge betwee two distict polyomial patches meets the midpoit of a edge of a third. With each refiemet, Catmull-Clark subdivisio geerates T-corers betwee the patches of adjacet surface rigs (Figure 6, left top). Polar subdivisio does ot geerate T-corers (Figure 6, right top) sice the cotrol et refies oly towards the extraordiary poit (Figure ). Oe approach for geeratig a faceted approximatio covergig to the uderlyig surface is to split the quadrilaterals of the polar et at each refiemet ito four ad leave the triagles utouched. This yields T-corers i the faceted approximatio (Figure 6, right bottom). Reflectig the bias towards presetig a mesh without T- corers versus obtaiig a surface without T-corers, Catmull-Clark subdivisio is usually illustrated by a sequece of cotrol ets (Figure,left bottom), hidig the surface T-corers, while polar surfaces are preferably itroduced as a sequece of surface rigs. patches cotrol facets Catmull-Clark polar Fig. 6. Layout of patches ad cotrol polyhedro for Catmull-Clark subdivisio (left) ad polar subdivisio (right). The T- corers i Catmull-Clark (left top) are itrisic (the coarser patch is C at the T- corer). The T-corers i the refied polyhdero (right bottom) are optioal ad ot part of the polar et. Covexity ad Valece. Decreasig the parameter β i () pulls the surface closer to the extraordiary mesh ode. Recetly [Gikel ad Umlauf 2006] documeted how such straightforward maipulatio results i a limit surface i the desirable regio of a shape chart [Karciauskas et al. 2004]: decreasig β emphasizes covexity. We therefore chose β := /2 (see Figure 0) over β := 5/8 eve though the latter yields o-egative weights γ k = 8 (+ck )(+2ck )2 0. Table I shows the effect of β o the subsubdomiat eigevector v 20 of (4), that determies the shape i the covex settig, ad its secod differece v 20. For β = /2, the sector partitio curves are quadratic ad have a more proouced curvature tha for β = 5/8. We also observed that icreasig the valece by kot isertio improves the curvature distributio for covex eighborhoods (see e.g. Figure 0). This is due to the icreased symmetry of v 20 ad the fact that, if a curve is C at the cetral poit ad opposite curve segmets are mirror images, the the curve is C 2. ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

6 6 K. Karčiauskas ad J. Peters β 3/8 4/8 5/8 6/8 v 20 (, 5, 29, 68) t (, 2,, 26) t (,,5, 2) t (, /2, 2, 5) t 2 v 20 (8, 5) t (6, 6) t (2, 3) t (0, 3/2) t 5. CONCLUSION Table I. Coefficiets of v 20, the eigevector of the zeroth Fourier mode to the eigevalue /4. The algorithm just defied ad aalyzed is a polar cousi of Catmull-Clark subdivisio. Its curvatures are bouded just as [Sabi 99]. Its simplicity ad the fact that the output cosists of bicubic patches recommed bicubic polar subdivisio as a useful additio to Catmull-Clark subdivisio. This additio gives the desiger more freedom just where Catmull-Clark subdivisio ecouters shape deficiecies, the valece is high or polar layout is atural. The paper [Myles et al. 2007] explais i detail how bicubic Catmull-Clark ad bicubic polar subdivisio ca be combied for smooth object desig such as i Figure 2. ACKNOWLEDGMENTS This work was supported i part by NSF Grats DMI ad CCF Ashish Myles implemeted the algorithm. REFERENCES CATMULL, E. AND CLARK, J Recursively geerated B-splie surfaces o arbitrary topological meshes. Computer Aided Desig 0, DEROSE, T., KASS, M., AND TRUONG, T Subdivisio surfaces i character aimatio. I Siggraph 998, Computer Graphics Proceedigs, M. Cohe, Ed. ACM Press, GINKEL, I. AND UMLAUF, G Loop subdivisio with curvature cotrol. I Proceedigs of Symposium of Graphics Processig (SGP), Jue , Cagliari, Italy, A. Scheffer ad K. Polthier, Eds. ACM Press, KARČIAUSKAS, K., MYLES, A., AND PETERS, J A C 2 polar jet subdivisio. I Proceedigs of Symposium of Graphics Processig (SGP), Jue , Cagliari, Italy, A. Scheffer ad K. Polthier, Eds. ACM Press, KARČIAUSKAS, K. AND PETERS, J Surfaces with polar structure. Computig 79, KARCIAUSKAS, K., PETERS, J., AND REIF, U Shape characterizatio of subdivisio surfaces case studies. Computer-Aided Geometric Desig 2, 6 (july), LOOP, C Smooth terary subdivisio of triagle meshes. I Curve ad Surface Fittig, Sait-Malo. Vol. 0(6). Nashboro Press, 3 6. MORIN, G., WARREN, J., AND WEIMER, H A subdivisio scheme for surfaces of revolutio. Comp Aided Geom Desig 8, 5, MYLES, A., KARČIAUSKAS, K., AND PETERS, J Extedig Catmull-Clark subdivisio ad PCCM with Polar structures. I Proceedigs of Pacific Graphics, Hawaii, M. Alexa, S. Gortler, ad T. Ju, Eds. ACM Press, xx xx. PETERS, J. AND REIF, U Aalysis of geeralized B-splie subdivisio algorithms. SIAM Joural o Numerical Aalysis 35, 2 (Apr.), PETERS, J. AND SHIUE, L.-J Combiig 4- ad 3-directio subdivisio. ACM Tras. Graph 23, 4, REIF, U A uified approach to subdivisio algorithms ear extraordiary vertices. Comp Aided Geom Desig 2, SABIN, M. 99. Cubic recursive divisio with bouded curvature. I Curves ad Surfaces, L. S. P.J. Lauret, A. LeMéhauté, Ed. Academic Press, SCHAEFER, S. AND WARREN, J. D O C 2 triagle/quad subdivisio. ACM Tras. Graph 24,, STAM, J. AND LOOP, C. T Quad/triagle subdivisio. Comput. Graph. Forum 22,, UMLAUF, G Glatte freiformfläche ud optimierte uterteilugsalgorithme. Ph.D. thesis, Computer Sciece. ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

7 Bicubic Polar Subdivisio 7 Fig. 7. Mirrored 6-sided pyramid. (left) cotrol et; (middle ad right) subdivisio surfaces (three light sources) usig (middle) Catmull-Clark subdivisio, (right) polar bicubic subdivisio (with Gauss-curvature shaded iset). Fig. 8. Iteded ripples: (left) Cotrol et (middle) Catmull-Clark subdivisio (ote additioal micro-ripples); (right) polar subdivisio. Fig. 9. Nocovex polar et, ested surface rigs of polar subdivisio, shaded surface ad reflectio lies o the saddle. cotrol et = 6, β = 5 8 = 2, β = 5 8 = 6, β = 2 = 2, β = 2 Fig. 0. The effect of chagig the parameters β ad of bicubic polar subdivisio o the everywhere positive Gauss-curvature of a capped cylider. ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

8 8 K. Karčiauskas ad J. Peters Fig.. (left) Sample meshes; (middle) bicubic surface rigs; (right) Polar subdivisio surfaces. Fig. 2. Bicubic subdivisio with Catmull-Clark rules applied where 4 quadrilaterals meet ad polar rules where triagles meet (grey surfaces). ACM Trasactios o Graphics, Vol. V, No. N, Moth 20YY.

Tuned Ternary Quad Subdivision

Tuned Ternary Quad Subdivision Tued Terary Quad Subdivisio Tiayu Ni ad Ahmad H. Nasri 2 Dept. CISE, Uiversity of Florida 2 Dept. of Computer Sciece America Uiversity of Beirut Abstract. A well-documeted problem of Catmull ad Clark subdivisio

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

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 information

Reading. Subdivision curves and surfaces. Subdivision curves. Chaikin s algorithm. Recommended:

Reading. 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 information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

Improved triangular subdivision schemes 1

Improved 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 information

Approximating Catmull-Clark Subdivision Surfaces with Bicubic Patches

Approximating Catmull-Clark Subdivision Surfaces with Bicubic Patches Approximatig Catmull-Clark Subdivisio Surfaces with Bicubic Patches CHARLES LOOP Microsoft Research ad SCOTT SCHAEFER Texas A&M Uiversity We preset a simple ad computatioally efficiet algorithm for approximatig

More information

Smooth Spline Surfaces over Irregular Meshes

Smooth 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 information

GEORG UMLAUF. Abstract. Tools for the analysis of generalized triangular box spline subdivision schemes are

GEORG 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 information

Convex hull ( 凸殻 ) property

Convex 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 information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

HARTMUT PRAUTZSCH and GEORG UMLAUF. Fakultat fur Informatik, Universitat Karlsruhe. [prau/umlauf

HARTMUT 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 information

Pairs of Bi-Cubic Surface Constructions Supporting Polar Connectivity

Pairs of Bi-Cubic Surface Constructions Supporting Polar Connectivity Pairs of Bi-Cubic Surface Constructions Supporting Polar Connectivity Ashish Myles a, Kestutis Karčiauskas b Jörg Peters a a Department of CISE, University of Florida b Department of Mathematics and Informatics,

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating 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 information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An 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 information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern 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 information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 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 information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic 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 information

3D Model Retrieval Method Based on Sample Prediction

3D 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 information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

SUBDIVISION surfaces are becoming more and more popular

SUBDIVISION 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

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Math Section 2.2 Polynomial Functions

Math 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 information

An Efficient Algorithm for Graph Bisection of Triangularizations

An 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 information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric 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 information

Loop Subdivision Surface Based Progressive Interpolation

Loop 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 information

G 2 Tensor Product Splines over Extraordinary Vertices

G 2 Tensor Product Splines over Extraordinary Vertices Eurographics Symposium o Geometry rocessig 28 ierre Alliez ad Szymo Rusikiewicz Guest Editors Volume 27 28, Number 5 G 2 Tesor roduct Splies over Extraordiary Vertices Charles Loop 1 ad Scott Schaefer

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

Lecture 24: Bezier Curves and Surfaces. thou shalt be near unto me Genesis 45:10

Lecture 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 information

Counting Regions in the Plane and More 1

Counting 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 information

2D Isogeometric Shape Optimization considering both control point positions and weights as design variables

2D 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 information

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. 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 information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting 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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 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 information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.

More information

Protected points in ordered trees

Protected 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 information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

Consider the following population data for the state of California. Year Population

Consider 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 information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

1 Graph Sparsfication

1 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 information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

The Platonic solids The five regular polyhedra

The Platonic solids The five regular polyhedra The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral

More information

The Adjacency Matrix and The nth Eigenvalue

The Adjacency Matrix and The nth Eigenvalue Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The 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 information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

Polynomial 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

Polynomial 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 information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Visualization of Gauss-Bonnet Theorem

Visualization 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 information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

Big-O Analysis. Asymptotics

Big-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 information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED 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 information

Accuracy Improvement in Camera Calibration

Accuracy 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 information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Computational Geometry

Computational 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 information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels: DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting 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 information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,

More information

Force Network Analysis using Complementary Energy

Force 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 information

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree 1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

A General Framework for Accurate Statistical Timing Analysis Considering Correlations

A General Framework for Accurate Statistical Timing Analysis Considering Correlations A Geeral Framework for Accurate Statistical Timig Aalysis Cosiderig Correlatios 7.4 Vishal Khadelwal Departmet of ECE Uiversity of Marylad-College Park vishalk@glue.umd.edu Akur Srivastava Departmet of

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

Perhaps 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

Perhaps 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 information

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein

Lecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein 068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Improved Random Graph Isomorphism

Improved Random Graph Isomorphism Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such

More information

CS Polygon Scan Conversion. Slide 1

CS Polygon Scan Conversion. Slide 1 CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear

More information

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

On Smooth Bicubic Surfaces from Quad Meshes

On Smooth Bicubic Surfaces from Quad Meshes On Smooth Bicubic Surfaces from Quad Meshes Jianhua Fan and Jörg Peters Dept CISE, University of Florida Abstract. Determining the least m such that one m m bi-cubic macropatch per quadrilateral offers

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting 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 information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

Project 2.5 Improved Euler Implementation

Project 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 information

Big-O Analysis. Asymptotics

Big-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 information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015. Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative

More information

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation The Nature of Light Chapter Reflectio ad Refractio of Light Sectios: 5, 8 Problems: 6, 7, 4, 30, 34, 38 Particles of light are called photos Each photo has a particular eergy E = h ƒ h is Plack s costat

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 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 information

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )

EE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 ) EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

South Slave Divisional Education Council. Math 10C

South 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 information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

Optimized Aperiodic Concentric Ring Arrays

Optimized Aperiodic Concentric Ring Arrays 24th Aual Review of Progress i Applied Computatioal Electromagetics March 30 - April 4, 2008 - iagara Falls, Caada 2008 ACES Optimized Aperiodic Cocetric Rig Arrays Rady L Haupt The Pesylvaia State Uiversity

More information

Computing the minimum distance between two Bézier curves

Computing 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 information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information