Tuned Ternary Quad Subdivision
|
|
- Edwin Evans
- 6 years ago
- Views:
Transcription
1 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 is that, i the eighborhood of extraordiary poit, the curvature is ubouded ad fluctuates. I fact, sice oe of the eigevalues that determies elliptic shape is too small, the limit surface ca have a saddle poit whe the desiger s iput mesh suggests a covex shape. Here, we replace, ear the extraordiary poit, Catmull- Clark subdivisio by aother set of rules derived by refiig each bi-cubic B- splie ito ie. This provides may localized degrees of freedom for special rules so that we eed ot reach out to, possibly irregular, eighbor vertices whe tryig to improve, or tue the behavior. We illustrate a strategy how to sesibly set such degrees of freedom ad exhibit tued terary quad subdivisio that yields surfaces with bouded curvature, oegative weights ad full cotributio of elliptic ad hyperbolic shape compoets. Keywords: Subdivisio, terary, bouded curvature, covex hull Itroductio Tuig a subdivisio scheme meas adjustig the subdivisio rules or stecils to obtai a refied mesh ad surface with prescribed properties. To date, there exists o subdivisio algorithm o quadrilateral meshes that yields bouded curvature while guarateeig the covex hull property at the extraordiary odes. This paper proposes terary refiemet to obtai such a scheme. Terary subdivisio offers more parameters i a close viciity of each extraordiary ode to tue the subdivisio tha biary subdivisio does ad thereby localizes the tuig. Terary quad subdivisio geeralizes the splittig of each quad ito ie. If all odes of a quad are of valece 4, the rules for bi-cubic B-splies show i Figure 3 are applied ad we have C 2 cotiuity. The challege is with odes of valece other tha 4, called extraordiary odes. I particular, we ca devise rules at the extraordiary odes ad their ewly created direct ad diagoal eighbors to achieve eigevalues i order of magitude as, λ, λ, λ 2, λ 2, λ 2, λ i,... ad 0 λ i < 9 for i = 7,.., 2 + ; ad oegative weights. It is possible to get, i additio, λ = /3. Yet, Figure 2 shows that the macroscopic shape of the ew scheme ad Catmull-Clark are very similar (Figure 2), but, of course, the mesh is deser.
2 2. Fig.. (left) Cotrol et: x, y the characteristic map of Catmull-Clark subdivisio ad z = 50( x 2 5y 2 ); subdivisio steps 3,4,5 ad surface for Catmull-Clark subdivisio (top) ad terary subdivisio (bottom). Fig. 2. Three steps of Catmull-Clark subdivisio (left) ad terary subdivisio (right).
3 3. Backgroud Subdivisio is a widely adopted tool i computer graphics ad is also makig iroads ito geometric modelig, if oly for coceptual modelig. However, [5] poited out that Catmull-Clark subdivisio i particular, is lackig the full set of elliptic ad hyperbolic subsubdomiat eigefuctios ad therefore typically geerates saddle shapes i the limit at vertices with valece greater tha four (see Figure top). This implies that ay high-quality (stadard, symmetric) scheme eeds to have a spectrum, λ, λ, λ 2, λ 2, λ 2 followed by smaller terms. With the strategy explaied i the followig, it is possible to achieve such a spectrum by makig subdivisio stecils ear the extraordiary poit deped o the valece (Figure bottom). While such localized improvemet caot be expected to produce high-quality surfaces i all cases, it is worth seeig whether such improvemets ca lead to improved rules that are easy to substitute for the kow usatisfactory rules. A major challege is techical: there are either too few or far too may free parameters occurig i oliear iequality costraits. This makes ay selectio by geeral optimizatio [] impractical. I [3, 4], Loop proposed improvemets to his Fig. 3. The regular (bicubic B-splie refiemet) stecils of Catmull-Clark (left) ad terary quad subdivisio (right). well-kow triagular scheme o triagular meshes to achieve both bouded curvature for a biary ad terary schemes. To derive weights, he used fixed-degree iterpolatio of kow weights to set may ukow weights ad reduce the umber of free parameters. But quad mesh schemes are far more difficult tha triagular mesh schemes sice the leadig eigevalues come from a 2 by 2 diagoal block matrix rather tha from a by block. They are therefore the roots of quadratic polyomials while, i the case of triagular meshes, the eigevalue is simple. For -sided facets, the problem is eve more complex due to 4 4 blocks but ca be avoided by applyig oe iitial Catmull-Clark subdivisio step. 2 Problem Statemet We wat to derive a terary, quad subdivisio scheme that is statioary, (rotatioal ad p-mirror) symmetric ad affie ivariat. The the leadig eigevalues are, i order of
4 4 magitude,, λ, λ, µ, µ 2, µ 3. To achieve bouded curvature, the covex hull property, the eigevalues ad the weights α i, β i, γ i, δ i ad v i of the terary quad scheme (see Figure 4) have to satisfy the followig costraits: (i) C scheme > λ > µ i, ad the characteristic map is regular ad ijective. (ii) Bouded Curvature µ = µ 2 = µ 3 = λ 2. (iii) Covex Hull α i 0, β i 0, γ i 0, δ i 0, i = 0.., v, v 2 0, e 0 := P i=0 (αi + βi) 0, f0 := P i=0 (γi + δi) 0, v 0 := P 2 i= (vi) 0. (iv) Symmetry α l = α l, β l = β l, γ l = γ (+ l) mod, ad δ l = δ l We focus o the leadig eigevalues ad hece the -rig of cotrol mesh aroud extraordiary poit ad its eigestructure. As show i Figure 4, each refiemet step geerates three types of poits correspodig to vertices, edges ad faces respectively. Let be the valece of a geeric extraordiary poit. We have, offhad, 4+2 weights to determie. Symmetry reduces this to free parameters. v 2 β δ v v v v v v v 2 v v 2 α 2 e 0 α 2 v 2 β 2 δ 2 Vertex Mask Edge Mask Face Mask 0 0 α α β 0 α 0 γ 2 γ 2 f 0 γ δ 0 γ β γ δ Fig. 4. Refiemet stecils used at a extraordiary poit. 3 Spectral Aalysis The -rig subdivisio matrix S with the cotrol vertices show i Figure 4 is: v 0 v v 2 v v 2 v v 2 e 0 α 0 β 0 α β α β f 0 γ 0 δ 0 γ δ γ δ e 0 α β α 0 β 0 α 2 β 2 S := f 0 γ δ γ 0 δ 0 γ 2 δ 2 R (2+) (2+) e 0 α β α 2 β 2 α 0 β 0 f 0 γ δ γ 2 δ 2 γ 0 δ 0
5 5 Now deote the discrete Fourier trasform of a cyclic sequece {φ i } by ˆφ i := φ j ω i,j, w i,j := e 2π ij. Lemma The spectrum of S is Λ = diag(, λ + 0, λ 0, λ+ i, λ i,, λ+, λ ) where λ ± i := (ˆα i + ˆδ i ) ± (ˆα i ˆδ i ) 2 + 4ˆβ iˆγ i, i =.... () 2 Proof. Sice the 2 2 lower block matrix of S is cyclic, we ca apply the discrete Fourier trasform ( ) 0 F := 0 I 2 (ω i,j ) to obtai v 0 v v e 0 ˆα 0 ˆβ f 0 ˆγ 0 ˆδ e ˆα ˆβ 0 0 Q := F SF = f ˆγ ˆδ e ˆα ˆβ f ˆγ ˆδ The eigevalues, λ + 0, ad λ 0 come from the first 3 3 block. Each 2 2 diagoal block ( ) ˆαi ˆβi, i =..., ˆγ i ˆδi cotributes the pair of eigevalues (). By (iv) ad sice λ + i ad λ + i are complex cojugate, we aticipate the followig lemma. Lemma 2 λ + i = λ + i, λ i = λ i, ad λ+ i, λ i R. Proof. By symmetry (iv), ˆα i = α 0 + {2 2 j= α j cos 2πij 2 2 j= α j cos 2πij if is odd, + α cosπi if is eve. (2) 2 Sice cos 2πij 2π( i)j = cos ad cos(πi) = whe i is eve, ˆα i = ˆα i R. The same reasoig applies to ˆδ i, ˆβ i e π i ad ˆγ i e π i sice, e.g. ˆβ i e π i = {2 2 β j cos (2πj+π)i 2 2 β j cos (2πj+π)i Therefore, λ ± i = λ ±+ i R as claimed. + β 2 cosπi if is odd, if is eve. (3)
6 6 For = 4 the subdivisio stecils are show i Figure 3. Based o this subdivisio matrix, we ca compute the matrix Q i Sectio 3 ad therefore compute explicitly the expasios collected i Lemma 3. Lemma 3 I the regular settig ( = 4), [ˆα 4 0, ˆα 4, ˆα 4 2, ˆα 4 3] = [ , 9 8, 9, 9 8 ], [ˆβ 0 4 e π i, ˆβ 4 e π i, ˆβ 2 4 e π i, ˆβ 3 4 e π i ] = [ , 4 2 2, 0, ], [ˆγ 0 4 e π i, ˆγ 4 e π i, ˆγ 2 4 e π i, ˆγ 3 4 e π i ] = [ , 6 2 2, 0, ], [ˆδ 0, 4 ˆδ, 4 ˆδ 2, 4 ˆδ 3] 4 = [ 2 729, 8, 9, ]. (4) 8 4 Derivig Weights by Iterpolatig the Regular Case The idea of derivig extraordiary rules is ispired by Loop s approach [4]. First, we iterpolate the regular stecil by a polyomial. Such a polyomial, say β, will be evaluated to defie the coefficiets βi. For = 4, due to symmetry, the costraits o the polyomial β are β (cos π ) = ad β (cos 3π ) = The liear iterpolat to these values is egative o some subiterval of [, ] ad therefore caot give suitable coefficiets βi 0 for > 4. Addig the costrait β ( ) = 0 yields the polyomial β 4 (t) := ((44 8 2)( t) 2 + (44 9 2)2t( t) + (36 2)t 2) 729 which is oegative o [, ]. We cojecture the geeral formulae for arbitrary based o the polyomials of the same low degree ad choose α (t) := a, ( (t + b, ) 2 + c, ), β := 4 β4, γ := 6 β4, δ (t) := a,4 ( (t + b,4 ) 2 + c,4 ). (5) Now, we predict the geeral formulae for ay > 4 by evaluatig the polyomials at the x-compoet of poits equally distributed over the uit circle. This yields two of the three types of stecils at the extraordiary poit ad leaves, as degrees of freedom, the coefficiets depedig o i (5). Lemma 4 The subdivisio rules, for valece ad j = 0... ca be chose as α j := α (u), δ j := δ (u), u := cos 2πj, (6) β j := β (v + ), v + := cos 2πj + π, γj := γ (v ), v = cos 2πj π
7 7 where a, := 4 ˆα 2, b, := ˆα a,, a,4 := 4 ˆδ 2, b,4 := ˆδ a,4. (7) Note that, together with β ad γ, equatios (7) yield explicit expressios for λ ± ad λ± 2 i terms of the the coefficiets a,, b,, c,, a,4, b,4, c,4. Proof. By symmetry, the weights are a discrete cosie trasformatio of their Fourier coefficiets: α i = γ i = ˆα j cos 2πij, ˆγ j cos β i = ˆβ j 2πij πj, δi = 2πij + πj cos, (8) ˆδ j cos 2πij. For = 4, we verify the cosistecy of the choice (6) by substitutig (4) ito (8). α 4 i = ( 9 (u )2 + 5, δ 4 324) i = ( (u )2 4 ). 324 Next, we decompose the polyomial ito a vector of basis fuctios ad a vector of coefficiets: a, ( (u+b, ) 2 +c, ) = [, u, 2u 2 ][a, b 2, + 2 a,+a, c,, 2a, b,, 2 a,] T. We mimic this decompostio for > 4, by choosig ˆα i = 0 for 2 < i < 2. The α i = ˆα j cos 2πij 2πi = [, cos, cos 4πi ][ ˆα 0, 2 ˆα, 2 ˆα 2 ]T. Sice cos 2πi 4πi = u, we have cos = 2u2 ad compariso of terms yields 2a, b, = 2 ˆα, ad 2 a, = 2 ˆα 2. Solvig a,, b, i terms of ˆα, ˆα 2,, ad similarly for δi, yields (7). The rules of Lemma 4 preserve rotatioal ad p-mirror symmetry. For > 4, they reduce the free parameters from to six, amely a,i, b,i, c,i, i =, 4. (For = 3 we use the origial = 0 free parameters to eforce λ + = λ, λ = λ 2, λ + 0 = λ2, λ 0 < λ2.) It remais eed to determie the six free parameters so that for > 4 the weigths α j, δ j, v, v 2, e 0, f 0, v 0 are oegative (β j ad γ j are oegative sice β 4 0 o [, ]) ad Λ = diag(, λ +, λ+, λ+ 2, λ+ 2, λ+ 0, ν, ν 2,...,ν 2 5 ) (9) = diag(, λ, λ, λ 2, λ 2, λ 2,...,λ i,...), where 0 < λ i < λ 2.
8 8 By (), ad sice ˆγ k ad ˆβ k are fixed, each of the costraits λ + = λ ad λ+ 2 = λ2 is a equatio i the parameters, a,, b,, a,4, b,4, explicitly so due to (7). The additioal ecessary costrait, λ + 0 = λ2, λ 0 < λ2 is eforced by choice of v, v 2 i the first 3 by 3 block of Q. The result is a udercostraied system with liear iequality costraits. We fid, for example, the closed-form solutio for = stated i Lemma 5 ad yieldig the elliptic ad saddle shapes show i Figure 7. Lemma 5 For = 5..0, the followig choice satisfies (i)-(iv) ad λ = /3: a, =.43, b, =.624, c, =.229 a,4 =.260, b,4 =.286, c,4 =.058 (0) Proof. We eed oly verify (i), (ii) ad (iii) listed i Sectio 2 sice the scheme is symmetric by costructio. Table shows all eigevalues other tha, 3, 3, 9, 9, 9 for = I particular, λ = λ = 3 is the subdomiat eigevalue. Table 2 verifies oegative weights summig to. The u-differeces, scaled to uit size, fall strictly ito the lower right quadrat ad, by symmetry, the v-differeces fall strictly ito the upper right quadrat (Figure 6). The partial derivatives are a covex combiatio of the differeces ad hece all pairwise crossproducts are strictly positive. By [8], the characteristic map is regular. I additio, as show i Figure 5, the first half-segmet of the cotrol et does ot itersect the egative x-axis. By the covex hull property ad [7] Theorem 2, ijectivity of the characteristic map follows. ν i =3 =4 =5 =6 =7 =8 =9 =0 ν ν ν ν ν ν 6 ǫ ǫ ǫ ǫ ǫ ν 7 ǫ ǫ ǫ ǫ ǫ ν 8 ǫ ǫ ǫ ǫ ν 9 ǫ ǫ ǫ ǫ ν 0 ǫ ǫ ǫ ν ǫ ǫ ǫ ν 2 ǫ ǫ ν 3 ǫ ǫ ν 4 ǫ ν 5 ǫ Table. Eigevalues (see 9) other tha,,,,, for = < ǫ <.00 The mai cotributio of the paper is techical: to provide a maageable set of parameters that make it easy to satisfy the formal costraits (i) (iv). This set ca be further prued by miimizig regios of meshes where the scheme exhibits hybrid behavior [5], i.e. the Gauss curvature is ot uiquely of oe sig i the limit. It should be oted that this is typically ot eough to guaratee surface fairess, for example to avoid udue flatess whe covexity is idicated by the cotrol mesh.
9 9 Fig. 5. Cotrol polyhedro of the characteristic map for = Ijectivity test: each red fat segmet does ot itersect the egative x-axis. Fig. 6. The ormalized differeces i the u directio (gree) ad v directio (blue).
10 0 weights =3 =4 =5 =6 =7 =8 =9 =0 v v v e α β α β α β α β α β α 5.05 f δ γ = γ δ γ δ γ δ γ δ γ δ 5.05 Table 2. The subdivisio rule accordig to Lemma 5 has o-egative weights. 0 < ǫ <.00 Ackowledgmet: This work was supported by NSF Grat CCF ad America Uiversity of Beirut URB Jörg Peters gave valuable techical guidace ad assistace. Refereces. L. Barthe, ad L. Kobbelt, Subdivisio Scheme tuig aroud extraordiary vertices, Computer Aided Geometric Desig, 2: E. Catmull, ad J. Clark, Recursively Geerated B-splie Surfaces o Arbitrary Topological Meshes. Computer Aided Desig, 0(6): (978) 3. C. Loop, Smooth Terary Subdivisio of Triagle Meshes Curve ad Surface Fittig (Sait- Malo, 2002). 4. C. Loop, Bouded curvature triagle Mesh subdivisio with the covex hull property. The Visual Computer, 8 (5-6), K. Karciauskas, J. Peters ad U. Reif, Shape Characterizatio of Subdivisio Surfaces Case Studies, Comp. Aided Geom. Desig, 2(6), 2004,
11 Fig. 7. Surfaces geerated by the rules of Lemma A. Nasri, I. Hasbii, J. Zheg, T. Sederberg, Quad-based Terary Subdivisio, presetatio Dagstuhl Semiar o Geometric Modelig, 29 May - 03 Jue, U. Reif ad J. Peters. Structural Aalysis of Subdivisio Surfaces A Summary Topics i Multivariate Approximatio ad Iterpolatio, Elsevier Sciece Ltd, K. Jetter et al., 2005, G. Umlauf, Aalysis ad Tuig of Subdivisio Algorithms. Proceedigs of the 2st sprig coferece o Computer Graphics, (2005)
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 informationBicubic Polar Subdivision
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.
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 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 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 informationCubic 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 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 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 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 informationEigenimages. 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 informationLecture 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 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 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 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 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 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 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 informationcondition 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 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 informationLecture 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 information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
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 informationEigenimages. 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 informationAlpha 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 informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
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 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 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 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 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 informationAlgorithms 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 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 informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
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 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 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 informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
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 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 informationAssignment 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 informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
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 informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More information2) Give an example of a polynomial function of degree 4 with leading coefficient of -6
Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to
More informationThe 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 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 informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationThe 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 informationCharacterizing graphs of maximum principal ratio
Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
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 informationImproved 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 informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationData 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 informationANN 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 informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationThe 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 informationFast 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 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 informationMarkov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size
Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
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 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 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 informationLinearising Calibration Methods for a Generic Embedded Sensor Interface (GESI)
1st Iteratioal Coferece o Sesig Techology November 21-23, 2005 Palmersto North, New Zealad Liearisig Calibratio Methods for a Geeric Embedded Sesor Iterface (GESI) Abstract Amra Pašić Work doe i: PEI Techologies,
More informationFilter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design
Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of
More information1.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 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 informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationNew 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 informationOutline 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 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 informationCIS 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 informationEM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS
EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit
More informationNormals. In OpenGL the normal vector is part of the state Set by glnormal*()
Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct
More informationThe Graphs of Polynomial Functions
Sectio 4.3 The Graphs of Polyomial Fuctios Objective 1: Uderstadig the Defiitio of a Polyomial Fuctio Defiitio Polyomial Fuctio 1 2 The fuctio ax a 1x a 2x a1x a0 is a polyomial fuctio of degree where
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 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 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 informationEE123 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 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 informationImage 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 informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationG 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 informationWavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)
Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter
More informationA log n lower bound to compute any function in parallel Reduction and broadcast in O(log n) time Parallel prefix (scan) in O(log n) time
CS 267 Tricks with Trees Outlie A log lower boud to compute ay fuctio i parallel Reductio ad broadcast i O(log ) time Parallel prefix (sca) i O(log ) time Addig two -bit itegers i O(log ) time Multiplyig
More information. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.
MASSACHUSETTS INSTITUTE of TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.161 Moder Optics Project Laboratory 6.637 Optical Sigals, Devices & Systems Problem Set No. 1 Geometric optics
More informationApproximating 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 informationEVALUATION OF ALGORITHMS FOR SURFACE INTERPOLATION OVER TRIANGULAR PATCH. Jenn-Taur Lee
EVALUATION OF ALGORITHMS FOR SURFACE INTERPOLATION OVER TRIANGULAR PATCH Je-Taur Lee Departmet of Civil ad Evirometal Egieerig Uiversity of Wiscosi-Madiso Madiso, WI 53706 ABSTRACT Surface iterpolatio
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 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 informationCombination 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 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 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 informationA 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 informationLecture 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 informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
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 information