G 2 Tensor Product Splines over Extraordinary Vertices

Size: px
Start display at page:

Download "G 2 Tensor Product Splines over Extraordinary Vertices"

Transcription

1 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 2 1 Microsoft Research 2 Departmet of Computer Sciece, Texas A&M Uiversity Abstract We preset a secod order smooth fillig of a -valet Catmull-Clark splie rig with biseptic patches While a uderdetermied biseptic solutio to this problem has appeared previously, we make several advaces i this paper Most otably, we cast the problem as a costraied miimizatio ad itroduce a ovel quadratic eergy fuctioal whose absolute miimum of zero is achieved for bicubic polyomials This meas that for the regular 4-valet case, we reproduce the bicubic B-splies other cases, the resultig surfaces are aesthetically well behaved We exted our costraied miimizatio framework to hadle the case of iput mesh with boudary Categories ad Subject Descriptors accordig to ACM CCS: 35 [Computer Graphics]: Curve, surface, solid, ad object represetatios 1 troductio Catmull-Clark subdivisio surfaces have become a stadard modelig primitive i computer geerated films ad video games [CC78] The success of this algorithm is due to its ability to model surfaces of arbitrary geus, possibly with boudary [Nas87] The modelig paradigm is simple: a user specifies a coarse cotrol mesh cosistig of vertices, faces, ad edges that approximates a desired shape; the Catmull- Clark surface smoothly approximates the cotrol mesh i a ituitive fashio Artists easily grasp the behavior of these shapes relative to the cotrol mesh However, subdivisio surfaces cotai shape defects at extraordiary vertices where the umber of icidet edges is ot equal to 4 geeral the surface is oly C 1 at these isolated poits etertaimet scearios, the viewpoit is cotrolled or the presece of isolated shape defects is acceptable For modelig high quality shapes, subdivisio surfaces are iadequate Subdivisio surface behavior at extraordiary vertices has bee extesively studied ad their shape artifacts are by ow well uderstood [DS78, Rei95, R98, ra98, RS99] Taget plae cotiuity at extraordiary vertices was formally established i [Rei95] However, o modificatio to the subdivisio rules will result i curvature cotiuity at these poits [ra98] Modificatios that boud the otherwise ubouded curvature at extraordiary vertices have appeared [Sab91, ADS6, GU7] A weak form of curvature cotiuity has bee achieved by locally projectig the cotrol mesh to a flat spot with zero curvature [Rei98, U98] True curvature cotiuity has bee obtaied by bledig a disk shaped regio about the extraordiary vertex with a quadratic shape [Zor6, Lev6] All of these schemes are cocered with the limitig behavior of the subdivisio process, ad ot the removal of the uderlyig sigularities i the mappig from a maifold domai to a embeddig space Figure 1: a Each subdivisio step adds a ew splie rig to the iterior of the hole created by a extraordiary vertex b The work preseted i this paper fills the hole i a Catmull- Clark splie rig with biseptic patches,, 1 Examples of vertex types 1, 2, ad 3 are also show These sigularities, correspodig to the extraordiary vertices of the cotrol mesh, are a result of the iheretly Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd ublished by Blackwell ublishig, 96 Garsigto Road, Oxford OX4 2DQ, UK ad 35 Mai Street, Malde, MA 2148, USA

2 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices fuctioal splie machiery used by may subdivisio algorithms That is, Catmull-Clark surfaces are bicubic tesor product B-splies, albeit over procedurally defied cotrol meshes with ifiite structure Such a compoetwise fuctioal splie is a deformatio of a regular plaar lattice, so modelig a arbitrary geus surface with a more geeral tessellatio requires sigularities This fact is ivariable igored i the theoretical study of extraordiary vertex behavior uder subdivisio stead that study focuses o so-called splie rigs, a local collectio of surface patches that form a -sided hole about a extraordiary vertex, see Figure 1a As subdivisio proceeds, a ew splie rig is formed iside the hole such that the old ad ew splie rigs joi with the smoothess of the uderlyig B-splie the limit, the - sided hole becomes ifiitesimally small, but ever vaishes This ifiite set of polyomials ad the limitig behavior at extraordiary vertices complicates evaluatio ad processig of these surfaces [HKD93, Sta98] whereas surfaces composed of a fiite set of polyomials are substatially simpler 11 roblem Statemet ad Cotributios The problem we address ca be reduced to the followig: Fill the hole i a -valet Catmull-Clark splie rig with tesor product patches that joi each other ad the splie rig with secod order smoothess See Figure 1b for a illustratio Our solutio to this problem requires bidegree 7 patches This result was origially reported i [Loo4] While that work established the existece of a biseptic solutio space, ad-hoc meas were used to remove the extra degrees of freedom Here we make several improvemets ad cotributios; specifically 1 The derivatio of the uderdetermied biseptic solutio space is based etirely o properties of the correspodece maps betwee adjacet patches ad the ecessary cocycle coditio these maps must obey about vertices 2 Our surface is defied as a costraied miimizatio over a ovel eergy fuctioal that achieves a absolute miimum of zero for bicubic patches ad results i aesthetically pleasig shapes otherwise 3 We solve for data idepedet basis fuctios explicitly, as a off-lie preprocess Sice the basis fuctios are solved idepedet of the surface, we ca maipulate these surfaces i realtime 4 We defie basis fuctios to hadle meshes with boudary such that the surface iterpolates the cubic B-splie curve defied by the mesh boudary Fillig a splie rig with secod order smooth surfaces has practical applicatios i surface desig We use our results to costruct secod order smooth surfaces over refied quadrilateral cotrol meshes, where each quad has at most oe icidet extraordiary vertex Refiemet is eeded to isolate extraordiary vertices as is doe for Catmull-Clark evaluatio [Sta98] Ulike Catmull-Clark surfaces, our surfaces are secod order smooth everywhere ad cotai a fiite umber of polyomial patches 12 revious Work May papers addressig the problem of costructig first ad secod order smooth patch complexes have appeared over the last two decades We metio here oly those that explicitly joi tesor product polyomials with secod order smoothess at extraordiary vertices [ra97] a - valet Catmull-Clark splie rig is filled with bidegree 6 patches; however, 4 such patches are eeded Similarly, [GZ99] form a secod order smooth joi over extraordiary vertices with 4 bidegree 5 patches [et2] a combiatio of 2 bidegree 3 5 ad 2 bicubic patches would be eeded to fill a -sided hole surrouded by bicubics [K7], a collectio 16 patches of bidegree 4 4 ad 6 6 are used to form a smooth complex surrouded by bicubic patches While other works have achieved lower bidegree, with respect to total cotrol poit cout, bidegree 7 with patches is still the best result This makes the scheme attractive for GU implemetatio sice total data throughput is miimized this paper, we strive to improve shape quality, ad to make the results more practically applicable This paper is orgaized as follows Sectio 2 we preset aspects of geometric cotiuity ecessary to derive our results Sectio 3 we specify the correspodece maps betwee adjacet patches as required by the defiitio of geometric cotiuity Sectio 4 we use the correspodece maps to derive sets of costraits o the coefficiets of adjacet patches eeded for secod order smoothess Sectio 5 we preset a ovel quadratic eergy fuctioal, the show how this fuctioal is miimized subject to our costraits i Sectio 6 We solve for data idepedet basis fuctios, with support ad boudary costraits i Sectio 7 Fially, we preset results ad coclude with Sectio 8 2 Geometric Cotiuity Give a pair of surface patches i, i+1 : [,1] [,1] R m, we say i ad i+1 meet with k th order geometric cotiuity deoted G k [DeR85], if there exists a map θ such that i meets i+1 θ with parametric cotiuity C k, that is i G k = i+1 i C k = i+1 θ More formally, this coditio requires that the k th order derivatives of the two patches after reparameterizatio with respect to θ coicide We refer to the map θ : R 2 R 2 as the correspodece map betwee i ad i+1 Techically θ, alog with k of its trasversal derivatives, oly eeds to be defied o a lie correspodig to the commo patch boudary However we fid it coveiet to defie correspodece Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

3 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices maps i Bézier form over the etire uit square; this way trasversal derivatives o edges ad cosistet mixed partial derivatives at vertices are easily specified The derivatives of i+1 θ ca be foud via the chai rule ad yield a matrix equatio of the form D i = D i+1 θ Θ where [ D i is a vector of the ] partial derivatives of i ie D i = i i 2 i u v ad Θ is a matrix obtaied usig u 2 the chai rule that ecodes the partial derivatives of θ We refer to Θ as the chai rule matrix of θ f we make the simplifyig assumptio that θ is the idetity fuctio alog the commo boudary, the the above equatio reduces to D i = D i+1 Θ, 1 whe evaluated o the boudary This assumptio is reasoable as ay other choice of θ would lead to higher degree boudary curves with more smoothess costraits Equatio 1 tells us how to trasform the derivatives wrt the domai of i i terms of the derivatives of i+1 ad θ For a cyclic collectio of patches i icidet o a commo vertex with correspodece maps θ i betwee patches i ad i+1, i =,, 1 idices take modulo, satisfyig geometric cotiuity results i a cocycle coditio amog the patches f we evaluate equatio 1 at the commo vertex for all patches, we fid that D = D Θ 1 Θ 2 Θ 1 Θ, for patches icidet o that vertex Therefore, this relatioship results i the additioal requiremet that = Θ 1 Θ 2 Θ 1 Θ 2 whe evaluated at the commo vertex [Hah89] For G k cotiuity a correspodece map must ecode all k th order trasversal derivatives i the versal directio f we differetiate k times i this directio, will get mixed partials of order 2k These derivatives must agree at the commo vertex i order to get a polyomial parameterizatio Therefore, for G k cotiuity the chai rule matrices must ecode derivatives up to order 2k 3 Correspodece Maps We will costruct two types of correspodece maps o edges joiig three types of vertices: 1 a extraordiary vertex, 2 a edge adjacet eighbor of a type 1 vertex, 3 a face adjacet diagoal eighbor of a type 1 vertex, see Figure 1b Note that a type 1 vertex is -valet, vertex types 2 ad 3 are always 4-valet Over the edge betwee vertex types 1 ad 2 we defie iterior correspodece maps; over the edge betwee vertex types 2 ad 3 we defie exterior correspodece maps 31 terior Correspodece Maps We defie iterior correspodece maps i terms of the maps φ : u,v x,y defied by [ φ,x u,v = b 1 u T cos 2π 1 1 [ φ,y u,v = b 1 u T si 2π ta π ] b 1 v, ] b 1 v, where b d are degree d Berstei polyomials The geometry of φ is illustrated i Figure 21 Give that φ creates a agle of 2π aroud the extraordiary vertex, the correspodece map from patch i to i+1 is φ 1 r 1 φ where r is a couterclockwise rotatio of 2π about the origi We verify the cocycle coditio at a type 1 vertex usig the chai rule matrices Φ ad R for φ ad r respectively We form the compositio of the correspodece maps φ 1 r 1 φ from patches through 1 ad evaluate at,, correspodig to the extraordiary vertex to get = Φ 1 R 1 Φ = Φ 1 R 1 Φ Notice that R 1 = because r 1 is a rotatio of 2π The above expressio oly depeds o Φ beig locally ivertible at, The cocycle loop of correspodece maps icidet o a type 1 vertex is illustrated i Figure Exterior Correspodece Maps The secod type of correspodece map we eed is defied over a edge betwee vertex types 2 ad 3; this edge correspods to the boudary of the splie rig Ulike the iterior correspodece maps, we must carefully solve for the exterior correspodece maps previous work [Loo4] the same correspodece maps were derived by appealig to the embeddig space of the resultig patches Here we derive the correspodece maps strictly i terms of abstract adjacecy relatios of the uderlyig tessellatio We begi by defiig maps ψ : u,v x,y, where is the valece of the earby extraordiary vertex The exterior correspodece maps will be defied by ψ u,1 ad ψ 1,v, where u,v [,1] We require ψ to be the idetity o the edges u,,u, 1,, v, ad 1, v arameter values 1, ad, 1 correspod to type 2 vertices; 1, 1 correspods to the type 3 vertex Figure 22 illustrates the cocycle loop where four patches meet at a type 2 vertex Note that this vertex might share a edge with aother extraordiary vertex of valece m, which is possible give the miimum separatio of extraordiary vertices we require We ca factor the cocycle compositio ito two parts, correspodig to Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

4 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices Figure 2: The cocycle maps for the 3 vertex types : 1 extraordiary vertex, 2 edge sharig eighbor of a type 1 vertex 3 face sharig diagoal eighbor of a type 1 vertex the two eighborig extraordiary vertices to get {}}{ 1 = Q Ψ S R 1 Φ Φ Ψ 1 {}}{ 1 Q Ψ m S R 1 m Φ m Φm Ψ 1 m, 3 where Q is the chai rule matrix for qu,v = u, v the reflectio across the u axis, S is the chai rule matrix for su,v = v,u the reflectio across the diagoal u = v, R is the chai rule matrix for a 2π rotatio about the origi, ad Ψ is the chai rule matrix for ψ Note that parameter for evaluatio of these matrices correspods to the type 2 vertex Both factors of equatio 3 represet the idetity ad are the same up to valece The factor ivolvig will impose costraits of various partial derivatives o ψ at the type 2 vertex Additioal costraits o ψ come from the cocycle coditio at the type 3 vertex Figure 23 illustrates the cocycle loop where four patches meet at a type 3 vertex We assume that this vertex may be a diagoal eighbor of four extraordiary vertices By assumig the symmetry ψ u,v = ψ v,u, the cocycle compositio at a type 3 vertex ca be factored ito four parts, correspodig to the 4 arbitrary valece diagoal eighbors {}}{{}}{ = Ψ k S Ψ k S 1 Ψ l S Ψ l S 1 {}}{{}}{ Ψ m S Ψ m S 1 Ψ S Ψ S 1 4 This expressio holds sice S Ψ S = Ψ We use the costraits imposed o the derivatives of ψ by equatios 3 ad 4 to fid ψ,x u,v = 1 5c 3 3c 2 15c +18 c 2 +2c c 22c 3 12c 2 4 b 4 u T 1 c +3 c 2 +3c c 2 2 b 3 v, 3 4 c c where c = cos 2π By the symmetry coditio, we also have ψ,y u,v = ψ,x v,u The derivatio of this solutio is preseted i Appedix A Note that whe = 4, ψ 4 = 4 atch Smoothess Costraits We ow use the correspodece maps to determie secod order smoothess costraits o the coefficiets of the patches i,i =,, 1 41 Exteral Costraits A Catmull-Clark splie rig surface is completely characterized by a 3-rig of poits about a extraordiary vertex However, the secod order behavior of the splie rig boudary ca be described by a 2-rig We label the poits of this 2-rig i a cyclic fashio, as show i Figure 3 Note that we have seve poit sectios ad the cetral vertex is duplicated times; doig so will give us a circulat system of equatios i Sectio 43 We characterize the secod order behavior of the splie rig boudary with a set of bicubic patches The cotrol poits of these bicubic Bézier patches are foud by applyig the cubic kot isertio operator M = , 3 4 Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

5 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices Figure 3: A 2-rig a with poit labelig o the 2-rig cotrol poits This will covert from B-splie to Berstei form resultig i bicubic Bézier patches H i u,v = b 3 u T M T a 1 i+2 a 11 i+1 a 21 i+1 a 1 i 1 a i a 1 i+1 a 2 i+1 a 11 i 1 a 1 i a 11 i a 12 i a 12 i 1 a 2 i a 21 i a 22 i Mb3 v, where i =,, 1 ad a jk i are cotrol mesh vertices from Figure 3 Note that, due to the udefied cotrol poit represeted by a above, the patches H i ca oly be evaluated alog the exteral boudary u,1 ad 1,v; however, all derivatives up to secod order are well defied o this boudary Furthermore, these derivatives will meet the surroudig splie rig with C k cotiuity Next, we use the maps ψ from Sectio 32 to reparameterize the bicubic patches H i to get costraits o the exteral edge of our patches; that is j u j i 1,t = j H u j i ψ 1,t, j =,1,2 Expadig this expressio usig the chai rule results i the followig exteral costraits o patch i i 1,t = H i 1,t, 5 u i1,t = x H i1,t u ψ,x1,t + y H i1,t u ψ,y1,t, 6 2 u 2 i 1,t = x H i1,t 2 ψ u 2,x 1,t + y H i1,t 2 ψ u 2,y 1,t H x 2 i 1,t u ψ,x1,t xy H i1,t u ψ,x1,t u ψ,y1,t H y 2 i 1,t u ψ,y 1,t 7 The costraits alog the boudary t, 1 are defied similarly All terms o the right had sides of Equatios 5, 6, ad 7 are polyomials of kow degree From this, we ca deduce by degree coutig, that the patches i must be bidegree 7 To determie the umber of costraits give by equatios 5, 6, ad 7, we ote that each of these 3 equatios is a degree 7 polyomial with 8 degrees of freedom resultig i 24 costraits Therefore we have 48 costraits for both edges of the exteral boudary However, at u = v = 1 correspodig to a type 3 vertex, the cocycle coditio guaratees that the mixed partial derivatives will agree up to secod order, meaig that 9 of these costraits will be depedet; so there are oly 39 exteral costraits per patch, or 39 for all patches sharig the type 1 vertex 42 teral Costraits We ow derive costraits alog iteral patch edges We combie the iteral correspodece map φ 1 r 1 φ betwee the pair of surface patches i,t ad i+1 t,, with the defiitio of secod order geometric cotiuity to get the relatio j+k u j v k i,t = j+k u j v k i+1 φ 1 r 1 φ t, where j+k =,1,2 Expadig this gives us G, G 1 ad G 2 costraits i,t = i+1 t,, 8 c 1 t u i+1 t,+ v i,t = v i+1 t,+ u i,t, 9 2c 2 1 t v i+1 t, u i,t 2c 1 t1+c 1 t = 1+c 1 t + 2 uv i+1t, 2 2 v 2 i+1 t, 2 u 2 i,t uv i,t 1 We cout the umber of costraits determied by these equatios as follows Sice patches i are biseptic, we ca deduce by degree coutig the umber of costraits i equatios 8, 9, ad 1, are 8, 8, ad 9 respectively; therefore we have 27 costraits per iteral edge However, the exteral costraits derived i the previous sectio specify the 9 secod order mixed partial derivatives correspodig to the type 2 vertex at i+1 1, ad i,1 By the cocycle coditio, these derivatives will automatically satisfy 8, 9, ad 1 resultig i 9 depedet costraits Therefore the geometric cotiuity coditios itroduce 16 iteral costraits 43 Costrait System The 16 iteral costraits combied with the 39 exteral costraits results i a system of 55 equatios Each biseptic patch i has 64 coefficiets, so we have a system of 55 Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

6 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices equatios i 64 ukows All of our costraits are polyomial equatios that ca writte i terms of biseptic Bézier cotrol poits p jk i ad two-rig cotrol mesh vertices a lm i We ca write the costraits as a block circulat system that expads to Cp = Wa, 11 c c 1 p p 1 c = p 1 c 1 c w w 1 w 1 w 1 w w1 w 1 w 1 w a a 1 a 1 where p i are the ukow Bézier cotrol poits of patch i, ad a i the seve kow vertices of the i th two-rig sectio as labeled i Figure 3 Sice this system is uderdetermied, we itroduce a eergy fuctioal ad fid the solutio that miimizes this fuctioal with respect to the costraits 5 Bicubic Eergy Existig eergy fuctioals, eg thi plate or biharmoics, have the disadvatage that they are ot zero for bicubic surfaces Our costrait system will be cosistet with tesor product B-splies whe = 4 order to geeralize this case, we must defie a ew eergy fuctioal We therefore itroduce a eergy fuctioal, that to our kowledge has ot previously appeared i the CAGD literature, whose absolute miimum of zero is achieved for a bicubic tesor product patch, ad all higher degree parameterizatios of such a patch Let Fu, v be a tesor product patch Our bicubic eergy fuctioal is defied as the itegral 1 1 eergy = 4 2 Fu,v u Fu,v 4 v dudv 4 our case, F = i is a biseptic patch Sice the coefficiets of i are at most squared, our eergy fuctioal ca be writte as a quadratic form p T i E p i, where E is a symmetric matrix Because 4 / u 4 ad 4 / v 4 are idetically zero for all bicubic patches, ay vector p i cosistet with a bicubic patch or a degree elevated form will be i the kerel of E, implyig p T i E = E p i = We fid the bicubic eergy of the collectio of patches i by the product p T Ep, where E is a block diagoal matrix whose blocks are the sigle patch bicubic eergy matrix E, 6 Costraied Miimizatio We ca miimize quadratic eergy p T Ep subject to costraits Cp = Wa usig Lagrage multipliers Differetiatig with respect to p yields p p T Ep = p 2Ep = C T Λ p T C T a T W T Λ, These equatios ca be represeted by a sigle block matrix [ ][ ] [ ] E C T p = a C Λ W This system ca be put ito block circulat form by permutig its rows ad colums to get E c T c c T 1 c 1 = c 1 E c T c c T 1 c 1 c T 1 w w 1 w 1 w w 1 w 1 w 1 w E c T c w 1 a a 1 a 1 p λ p 1 λ 1 p 1 λ 1 Rather tha solvig this system directly, we trasform the problem from the spatial to frequecy domai by applyig the Discrete Fourier Trasform to the blocks The Discrete Fourier Trasform ad verse Discrete Fourier Trasform are give by 1 ˆx j = i= e 2π 1i j x i ad x i = 1 1 j= e 2π 1 i j ˆx j We use the DFT to put the above system ito block diagoal form, where the solutio is foud by solvig the idividual blocks [ E ĉ H j ĉ j ][ ] [ ˆp j = ˆλ j ŵ j ] â j, for j =,, 1, where ĉ H j deotes the cojugate traspose of ĉ j The patch coefficiets p i are foud by takig the DFT of the solutios ˆp j 7 Basis Fuctios To this poit, we have assumed that the two-rig data a i R m comes from a cotrol mesh f we let a i take the form [,,,1,,,] the we are istead solvig for the basis fuctio associated with some a jk i, correspodig to the o-zero elemet Sice our costrait systems do ot ivolve ay actual data, oly valece, we ca solve for the, Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

7 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices basis fuctios a priori, store the resultig basis patches ad multiply them by local mesh data at rutime Sice a tworig cotais sectios of seve poits, we oly eed to fid seve basis fuctios for each valece We label these seve basis fuctios A, A 1, A 2, A 11, A 21, A 12, ad A 22, where the idices correspod to the idices of a jk i to which they are associated A obvious questio to ask about these basis fuctio is: are they o-egative? By ispectig the Berstei coefficiets of the basis patches, we fid the aswer to be o, but just barely There are a few egative coefficiets o the order of 1 3, so this prevets us from claimig the covex hull property We should poit out that these egative values do ot come from the exteral costraits; so a differet yet to be determied eergy fuctioal could lead to the covex hull property Alteratively, we could fid the covex miimum to our costraied miimizatio problem; but this is complicated by the fact that we solve our system i the frequecy domai, ad covexity must be satisfied i the spatial domai We leave this optio for future work Aother issue cocerig the basis fuctio is their support; that is, the collectio of faces where a basis fuctio o-zero resetly, every basis fuctio supported over a extraordiary vertex, will have support over all faces icidet o that vertex deally, the support of a basis fuctio should ot exted beyod the two-rig of its correspodig vertex Otherwise, a extraordiary patch will deped o vertices outside the 1-rig of a quadrilateral face ie, vertices ot coected by a edge to oe of the quad face vertices This exteded support occurs for basis fuctios A 2, A 21, A 12, ad A 22 Note that the patches outside the two-rig of the basis fuctio are early zero, but ot absolutely We illustrate the poit for the basis fuctio A 21 i Figure 4 To deal with this issue, we eforce additioal support costraits o patches associated with basis fuctios A 2, A 21, A 12, ad A Support Costraits To eforce ideal support we solve modified costrait systems The cases of A 2, ad A 21 are similar; we treat A 12 as a istace of A 21 sice they are the same up to diagoal reflectio these cases, we wat the basis fuctios to have support over two adjacet patches i u,v ad i+1 u,v icidet o the extraordiary vertex We impose exteral costraits 5, 6, ad 7 o these two patches, as well as the iteral geometric cotiuity costraits 8, 9, ad 1 o the shared boudary i,t = i+1 t, Next, we add costraits to force the basis fuctio support boudary i t,, ad i+1,t to go to zero, alog with all derivatives up to secod order k v k i t, =, k u k i+1,t =, for k =,1,2 All patches other tha i ad i+1 are set to zero We the solve for miimum bicubic eergy as before Sice we oly eed to solve for two patches, we do so i the spatial domai Eforcig two-rig support o the basis fuctio A 22 is similar, except we oly eed to solve for a sigle patch We use the exteral boudary costraits, alog with costraits that force all derivatives up to secod order alog boudaries i,t ad i t, to zero rior to eforcig the support costraits, the basis fuctio were guarateed to sum to 1 sice the colums of the matrix W i equatio 11 sum to 1 Addig support costraits to select basis fuctios will cause this property to be violated We ca restore a partitio of uity by simply defiig A = 1 A i jk i jk 72 Boudary Basis Fuctios Figure 4: Cotours from 1/2 to 1/2 by 1/2 Red are positive cotours, gree zero, ad blue egative This basis fuctio reaches a maximum height 4/9 at the solid dot, so the bad of cotours show represets 225% of the height of the basis fuctio The basis fuctio A 21 is show a without support costraits, ad b with support costraits Not all cotrol meshes are closed Frequetly, artists model cotrol meshes with boudary For Catmull-Clark subdivisio surfaces, the subdivisio rules are modified so that the surface iterpolates the cubic B-splie curve defied by the boudary edges [Nas87, BLZ] We ca adapt this behavior to our surfaces by imposig mesh boudary costraits that force the surface to iterpolate the boudary cubic B- splie curve We assume a boudary extraordiary vertex is surrouded by a half two-rig of mesh cotrol poits We deote the valece of a boudary extraordiary vertex by m, the umber of icidet faces We use the same correspodece maps as before, with the caveat that = 2m First we eed to modify the exteral boudary costraits to take ito accout the presece of a mesh boudary We Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

8 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices defie two bicubic patches H u,v = b 3 u T M T ad a 1 2 a 11 1 a 21 1 a a 1 1 a 2 1 a 1 a 11 a 12 a 2 a 21 a 22 Mb 3 v, H m 1 u,v = where b 3 u T M T a 1 m 2 a m a 1 m a 2 m a 11 m 2 a 1 m 1 a 11 m 1 a 12 m 1 a 12 m 2 a 2 m 1 a 21 m 1 a 22 m 1 M = We defie two ew mesh boudary costraits as k u k 1,t = k H u k ψ 1,t, k v k m 1 t,1 = k H v k m 1 ψ t,1, Mb 3 v, for k =,1,2 We use the exteral patch boudary costraits 5, 6 ad 7 for boudaries t,1 ad m 1 1,t, ad for both exteral boudaries of patches i,i = 1,,m 2 We iclude the iteral geometric cotiuity costraits 8, 9, ad 1 betwee pairs of patches i, i+1,i =,,m 2 Fially, we iclude the boudary cubic B-splie costraits t, = [ a 1 m a a 1 a 2 m 1,t = [ a 1 a m a 1 m a 2 m ] M b 3 t, ] M b 3 t We the solve to miimize bicubic eergy as before Figure 6: From left to right: the cotrol mesh, the patch structure of a Catmull-Clark surface with bicubic patches show i gray top ad our surface with biseptic patches show i blue bottom, reflectio lies ad a zoom i close to a extraordiary boudary vertex For the Catmull-Clark surface, we use the boudary rules of [BLZ] Figure 7: Compariso of Gaussia curvature for a Catmull- Clark surface left, our techique middle ad [Loo4] right 8 Results We show several examples of our surfaces i figures 5 to 11 The quality of our shapes is quite good i geeral compared with Catmull-Clark subdivisio, especially ear boudary ad high valece extraordiary vertices Oe issue that we have oticed are curvature hotspots, high positive Gauss curvature, for valece = 3; similar to the behavior of Catmull-Clark surfaces We have ot treated this as a special case i ayway; though doig so may result i better shapes The lack of a covex hull property warrats additioal work o this scheme Refereces Figure 5: The cotrol mesh, patch structures of the Catmull- Clark top ad our surface bottom ad the reflectio lies Notice that the valece 8 vertex from the Catmull-Clark surface causes a oticeable kik i the reflectio lies that is abset with our G 2 surface [ADS6] AUGSDÖRFER U, DODGSON N, SABN M: Tuig subdivisio by miimisig gaussia curvature variatio ear extraordiary vertices Computer Graphics Forum 25, 3 26, [BLZ] BERMANN H, LEVN A, ZORN D: iecewise smooth subdivisio surfaces with ormal cotrol SGGRAH : roceedigs of the 27th aual coferece o Computer graphics ad iteractive techiques 2, pp [CC78] CATMULL E, CLARK J: Recursively geerated B-splie surfaces o arbitrary topological meshes Computer Aided Desig 1, , [DeR85] DEROSE A: Geometric Cotiuity: A arametrizatio depedet Measure of Cotiuity for Computer Aided Geoc 28 The Authors Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

9 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices Figure 8: Compariso of Gaussia curvature for a Catmull-Clark surface left, our techique middle ad [Loo4] right Figure 9: lots of the basis fuctios we compute for a valece 6 vertex The Bezier ets top row of the basis fuctios bottom row are composed of bicubic polyomials i the two-rig of a extraordiary vertex ad biseptic patches i the oe-rig Figure 1: Gaussia curvature plots of a boudary vertex with four quads for a Catmull-Clark surface left ad our techique right metric Desig hd thesis, Berkeley, 1985 also tech report UCB/CSD 86/255 2 [DS78] DOO D, SABN M: Behaviour of recursive divisio surfaces ear extraordiary poits Computer Aided Desig 1, , [GU7] GNKEL, UMLAUF G: Tuig subdivisio algorithms usig costraied eergy miimizatio Mathematics of Surfaces X 27, Marti R, Sabi M, Wikler J, Eds, Spriger-Verlag, pp [GZ99] GREGORY J, ZHOU J: rregular C 2 surface costructio usig b-polyomial rectagular patches Computer Aided Geometric Desig 16, , [Hah89] HAHN J: Geometric cotiuous patch complexes Computer Aided Geometric Desig 6, , [HKD93] HALSTEAD M, KASS M, DEROSE T: Efficiet, fair iterpolatio usig catmull-clark surfaces Computer Graphics 27, Aual Coferece Series 1993, [K7] KARCAUSKAS K, ETERS J: Guided C 2 splie surfaces with v-shaped tessellatio MA Coferece o the Mathematics of Surfaces 27, pp [Lev6] LEVN A: Modified subdivisio surfaces with cotiuous curvature Computer Graphics 25, Aual Coferece Series 26, [Loo4] LOO C: Secod order smoothess over extraordiary vertices roceedigs of the Symposium o Geometry rocessig 24, pp , 3, 8 [Nas87] NASR A H: olyhedral subdivisio methods for freeform surfaces ACM Tras Graph 6, , , 7 [et2] ETERS J: C 2 free-form surfaces of degree 3,5 Computer Aided Geometric Desig 19, 2 22, [R98] ETERS J, REF U: Aalysis of geeralized B-splie subdivisio algorithms SAM Joural o Numerical Aalysis 35, 2 Apr 1998, [ra97] RAUTZSCH H: Freeform splies Computer Aided Geometric Desig 14, , Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

10 C Loop & S Schaefer / G 2 Tesor roduct Splies over Extraordiary Vertices symposium o Geometry processig 26, Eurographics Associatio, pp Appedix A: Solvig for ψ We ow use the costraits implied by the cocycle coditios o vertices to solve for a mappig ψ that will miimize the bidegree of our G 2 surface splie the G 2 case, the cocycle coditio must hold for all secod order mixed partial derivatives geeral, the k th order derivatives will trasform via Equatio 1 i terms of all k th order derivatives of the correspodece maps However at type 2 ad 3 vertices this is ot the case sice at these 4-valet vertices, various mixed partial derives of the mappigs φ ad ψ vaish Therefore, the matrices i Equatios 3 ad 4 are 8 8 ad cotai the derivatives: Specifically, let Ψ = u, v, 2, 2 u 2 u v, 2, 3 v 2 u 2 v, 3, 4 u v 2 u 2 v 2 1 x 11 x 21 x 12 x 22 1 y 11 y 21 y 21 y x 11 2x x y 11 2x 11 2x x 11 y y y 11 2y y x y 11 1, Figure 11: Compariso of a valece 17 vertex for Catmull- Clark surface left, ad our techique right Below cotrol mesh: top row patch structure, middle row Gaussia curvature, ad bottom row reflectio lies [ra98] RAUTZSCH H: Smoothess of subdivisio surfaces at extraordiary poits Advaces i Computatioal Mathematics , [U98] RAUTZSCH H, UMLAUF G: A G 2 -subdivisio algorithm Geometric Modellig, volume 13 of Computig suppl 1998, G Fari H Bieri G B, DeRose T, Eds, Spriger- Verlag 1 [Rei95] REF U: A uified approach to subdivisio algorithms ear extraordiary vertices Computer Aided Geometric Desig , [Rei98] REF U: Turbs topologically urestricted ratioal b- splies Costructive Approximatio 14, , [RS99] REF U, SCHRÖDER : Curvature smoothess of subdivisio surfaces Tech Rep TR--3, Caltech, [Sab91] SABN M: Cubic recursive divisio with bouded curvature Curves ad Surfaces 1991, Lauret, Méhauté A L,, Schumaker L, Eds, Academic ress, pp Bosto 1 [Sta98] STAM J: Exact evaluatio of Catmull-Clark subdivisio surfaces at arbitrary parameter values Computer Graphics 32, Aual Coferece Series 1998, [Zor6] ZORN D: Costructig curvature-cotiuous surfaces by bledig SG 6: roceedigs of the fourth Eurographics where x i j = i+ j ψ u i u j,x 1, While y i j ca be defied similarly, we ote that sice by assumptio the x ad y compoets of ψ are symmetric, that is ψ,x v,u = ψ,y u,v, we eed oly solve for ψ,x Therefore y i j = i+ j u j u ψ i,x,1 Multiplyig together the matrices i Equatio 3 leads to the followig four costraits o ψ,x x 11 = c, x 21 =, y 12 = 2c y 11 + c, y 22 = 2c 2y 21 y 12 t is possible to satisfy these costraits with a bidegree 3 mappig; with this solutio, the derivative u ψ,x1,v will be degree 3 This term gets squared uder the chai rule leadig to higher degree surfaces tha ecessary stead we ca satisfy the above costraits with a bidegree 4 3 polyomial, leavig additioal freedom to lower the overall surface degree We ca write this polyomial ψ,x u,v = b 4 u T 1 cc 2 7c+6 18c+2α+27 c 2 +3c 18α c 32c 3 12c c α c β b3 v We ow solve for the 2 degrees of freedom α ad β so that u ψ,x1,v is degree 2 ad v ψ,xu,1 is degree 3 These costraits result i α = c2 +3c 9 9c 2, β = 9+c 12 As show i a Sectio 41, the bidegree of the resultig surfaces are miimized Joural compilatio c 28 The Eurographics Associatio ad Blackwell ublishig Ltd

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

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

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

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

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

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

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

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

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

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More 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

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

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

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

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

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

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

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

On (K t e)-saturated Graphs

On (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 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

G 1 Interpolation of arbitrary meshes with Bézier patches

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

Numerical Methods Lecture 6 - Curve Fitting Techniques

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

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra 1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators

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

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION 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 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

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

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

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

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

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

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

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

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

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

Analysis of Algorithms

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

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

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

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

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

Bicubic Polar Subdivision

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

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

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

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

Normals. 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 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

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

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

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

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

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

A Note on Least-norm Solution of Global WireWarping

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

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact 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 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

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 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 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

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

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.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 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

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

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

How do we evaluate algorithms?

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

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

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

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More 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

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL 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 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

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

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

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

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

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

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

Extended Space Mapping with Bézier Patches and Volumes

Extended Space Mapping with Bézier Patches and Volumes Eteded Space Mappig with Béier Patches ad Volumes Bejami Schmitt 1, 2 Aleader Pasko 1 Vladimir Savcheko 1 Abstract We eplore a geeral eteded space mappig as a framework for trasformig a hypersurface i

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More 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

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

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

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

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

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

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

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

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

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:

More information

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation

Task scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation 6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Lecture 5. Counting Sort / Radix Sort

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

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

CS 683: Advanced Design and Analysis of Algorithms

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

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

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

Computers and Scientific Thinking

Computers and Scientific Thinking Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

The Magma Database file formats

The Magma Database file formats The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

RTG Mini-Course Perspectives in Geometry Series

RTG Mini-Course Perspectives in Geometry Series RTG Mii-Course Perspectives i Geometry Series Jacob Lurie Lecture III: The Cobordism Hypothesis (1/27/2009) A quick review of ideas from previous lectures: The origial defiitio of a -dimesioal tqft provided

More information