Fun sheet matching: towards automatic block decomposition for hexahedral meshes

Size: px
Start display at page:

Download "Fun sheet matching: towards automatic block decomposition for hexahedral meshes"

Transcription

1 DOI /s ORIGINAL ARTICLE Fun st mtn: towrs utomt lok omposton or xrl mss Nols Kowlsk Frnk Loux Mttw L. Sttn Stv J. Own Rv: 19 Frury 2010 / Apt: 22 Dmr 2010 Ó Sprnr-Vrl Lonon Lmt 2011 Astrt Dpnn upon t numrl pproxmton mto tt my mplmnt, xrl mss r rquntly prrr to ttrrl mss. Bus o t lyr strutur o xrl mss, t utomt nrton o xrl mss or rtrry omtrs s stll n opn prolm. Ts lyr strutur usully rqurs topolol motons to propt lolly, tus prvntn t nrl vlopmnt o msn lortms su s Dluny s lortm or ttrrl mss or t vnn-ront lortm s on lol sons. To utomtlly prou n ptl xrl ms, w lm tt ot lol omtr n lol topolol normton must tkn nto ount n t ms nrton pross. In ts work, w propos tortl lsston o t lyrs or sts prtptn n t omtry ptur prour. Ts sts r ll unmntl, or un-sts or sort, n mk t onnton twn t lol lyr strutur o xrl mss n t omtr surs tt r ptur urn t msn pross. Morovr, w propos rst nrton lortm s on un-sts to l wt 3D omtrs vn 3- n 4-vlnt vrts. N. Kowlsk F. Loux (&) CEA, DAM, DIF, Arpjon, Frn -ml: rnk.loux@.r N. Kowlsk -ml: nols.kowlsk@.r M. L. Sttn S. J. Own Sn Ntonl Lortors, Aluqurqu, USA -ml: mlstt@sn.ov S. J. Own -ml: sjown@sn.ov Kywors Hxrl ms Blok-strutur ms Dul ms Funmntl ms Ms nrton 1 Introuton Computtonl [1] smultons pn upon t numrl pproxmton mto us, su s nt lmnt, nt rn, n nt volum mtos (to nm w), tt nl moln o pnomn o ntrst to t sn n nnrn ommunts. Crtl to o ts numrl pproxmton mtos s t srtzton o t pysl omn nto ms. Dpnn on t numrl pproxmtons mtos, xrl mss r prrr to ttrrl mss. T utomt nrton o xrl mss or ny omtr 3D ojt s, owvr, stll n opn prolm. In rnt s, rnt ppros v n ollow to nrt ull xrl ms or ny omtr 3D ojt. Strtn rom prms ounry sur som utors v propos pur omtr ppros lk plstrn [2] or H-morp [3] lortms, wl otr utors v ollow pur topolol ppro proposn rnt lortms [4 9] wt lmt suss. Som unll vts n rmn or nvrt lls, n ntv Jon lls n nrt ns t ms. By rlxn t onstrnt o workn wt pr-ms ounry, ns-out lortms [10 12] or unonstrn plstrn [13] v prov nourn xmpls o ll-x mss or rtrry omtrs. In spt o ts, ts mtos v tr wknsss. For nstn, ns-out lortms [10 12] o not onsr t lol topolol strutur n nrlly pl t worst qulty lmnts nr t ounrs wl t qulty o lmnts n ts rs n vry mportnt or numrl smulton.

2 T ulty o utomt xrl ms nrton s mnly u to t lyr strutur o xrl mss [14] tt n rqur topolol motons to propt lolly. Bus n utomt nrl ll-x soluton tt rlly prous -qulty lmnts or rtrry omtrs s not n vlop, t s otn nssry to ollow n-m ppro wt sotwr su s CUBIT [15] (mnly s on t swpn lortm [16 18]) or ICEM-CFD [19] (lok-strutur omposton) wr t usr rvs t xrl ms nrton y lvr omtry ompostons. Wt su tools, t usr must mnully trmn t rltonsp twn t omtr turs o t 3D ojts n t xrl lyrs to orm t nl ms. To utomtlly prou n ptl xrl ms, w lm tt w must onsr ot lol omtr n lol topolol normton n t ms nrton pross. Rnt works v monstrt t n or ts ppro [13, 20]. For xmpl, Sttn t l. [13] strt rom t ounry n ul omtr lyrs o xr prlll to t surs. Fnl stps o t prour nvolv ronzn n ttn strutur xrl tmplts su s swpn, mppn n mpont suvson to ll t rmnn vty. Altou promsn, ts omtr lortm msss t tortl ountons to nsur tt ny rmnn vty n 3D omtry n ll wt xr o sunt qulty. Ro n Srrt [20] strt rom ttrrl ms n ul ul surs onsrn lol ul ontrutons. T ul surs tt r ntrou orrspon to lyrs o xr lon t omtr surs. On ts lyrs r ult, xrl lok strutur n rv n strtorwr mnnr. Bot o ts ppros ttmpt to prou lyrs o xr prlll to t omtr surs y usn omtr n topolol lol normton. Exprn s sown, owvr, tt vn lol knowl o topoloy s not nou. T lol topolol strutur must onsr to rlly prou qulty xrl ms. Flur to mn lol topoloy my rsult n unsolv onurtons, wr t s mpossl to ll vty wt xr [13]or rsolv topoloy ontons n t 3D mol [20]. In ts work, w propos tortl lsston o t lyrs or sts prtptn n t omtry ptur prour. Ts lsston llows us to lnk omtr n lol topolol onstrnts n unqu onpt known s unmntl sts, or un-sts or sort. Funsts wll us to rv rst nrton lortm or t utomt ll-x prolm n srv s t ounton or ortomn works. T ppr s ornz s ollows. In St. 2, w rvw n nn som s ms strutur ntons rqur or t unrstnn o t lortm w prsnt n St. 3. In St. 3, w prsnt our nw lortm or utomt nrton o lok ompostons. In St. 4, w prov onlusons n sussons on utur work. 2 Funmntl st tory Unlk ttrrl mss, xrl mss v n nrnt lyr strutur, w mks ot lol motons [21 25] n utomt nrton o ll-xrl mss ult. T lyr strutur n xrl mss s t prmry rson or roustnss ssus wt prvous ttmpts t ll-xrl msn w rly on pr-ms ounry. 1 Ts lyr strutur n xrl mss s ormlly n s t ul, or t Sptl Twst Contnuum. W lm tt vlopmnt o rll ll-xrl msn lortm or rtrry omtry nnot on wtout tkn ts strutur nto ount. Morovr, ts strutur must onnt to t omtr turs o t pysl omn tt s to ms. In orr to ormlz ts onnton, Spr [27] n t noton o unmntl mss. 2.1 Bkroun T trtonl rprsntton o nt lmnt ms, ompos o xr, qurltrls, s n nos, s known s t prml ms. In most ss, t s sunt to sr xrl ms s n st o onnt xr tt srtzs 3D ojt (orrsponn to pysl omn usul or numrl smulton). Mor prsly, w n [28]: Dnton 1 (Hxrl ms) A xrl ms s 4-tupl (H, F, E, N) wr H s non-mpty st o xr, F s t non-mpty st o ll qurltrls nnt to on or mor xr n H, E s t non-mpty st o ll s nnt to on or mor xr n H, n N s t non-mpty st o ll nos nnt to on or mor xr n H. Ts s wt w nrlly ll t prml ms. Hxrl mss r us to srtz pysl omn X: T noton o srtzton rqurs tt ny omtr pont n X lons to only on ms ll n t ms wolly lls X: Ts noton s ptur y t ollown nton. 1 Unr t ptl ontons o vn volum somorp to ll n n vn numr o qurltrls on t ounry [26].

3 Dnton 2 (Hxrl ms srtzn 3D oun omn) Lt X 3D oun omn, xrl ms M = (H, F, E, N) srtzs X n only 8ð 1 ; 2 Þ2H 2 ; 1 \ 2 ¼;; 8x 2 X; 8 [ 0; 9 2 H; B x; \ 6¼;wr B x, s t -rus ll ntr n x. Trouout ts ppr, t s ssum tt ny mnton o xrl ms wll stsy ot o ts ntons. Intrstnly, ntr o ts prml ntons rrs to t lyr strutur nrnt n xrl mss. In ontrst, t Sptl Twst Contnuum [26], or ul ms, s s on ts lyr strutur. T ul s n rrnmnt o surs. Evry sur s ll st n s t ul o lyr o xr. T ntrston o two sts s or, w s t ul o olumn o xr. A or, or olumn o xr, s orm t t ntrston o two sts, or t t sl-ntrston o snl st. Howvr, or t purposs o ts ppr, w prr to work n t prml ms. A xrl ll H s 12 s ornz s tr sts o our topololly prlll s E 1, E 2, n E 3 (s F. 1). Tus, two s o H r s to topololly prlll on to t otr n only ty ot lon to t sm sust E 1, E 2, or E 3. Consrn xrl ms M = (H, F, E, N) n n [ E, w v H ¼ 1 ;...; n t xr nnt to, n w not E == ¼ ¼1;...;p t sust o E su tt V [ [1, p], A k [ [1, n], n r topololly prlll n k. T sust E // ns topolol sur tt n xtn to t jnt xr n so on, nn prml st. Exmpls o prml sts r vn n F. 2. F. 1 A xrl ll.,, T tr sts o our topololly prlll s o ts ll. As s n 0 lon to t sm sust pt n, ty r s to topololly prlll Dnton 3 (Prml st) Lt M = (H, F, E, N) xrl ms. Consrn n [ E, lt us n E s n t smllst sust o E su tt [ E n 8 2 E ; E == E : T st o xr nnt to ny n E orms t prml st rltv to. Smlrly, xrl ll s sx s ornz s tr prs o topolol oppost s F 1 ; F 2 ; n F 3. Two s r s to topololly prlll n only ot s lon to t sm xr n orm tr F 1 ; F 2 ; or F 3. E o ts sts ns lol olumn tt n xtn to t jnt xrl lls n so on, nn prml or. Exmpls o prml ors r vn n F. 3. F // nots t st o s topololly prlll to. 2 F. 2 On t lt, xrl ms nrt usn swpn lortm [16, 17]; on t rt, tr prml sts o ts ms r lt Dnton 4 (Prml or) Lt M = (H, F, E, N) xrl ms. Consrn [ F, lt us n F F. 3 On t lt, two prml ors r sown wl t 2 In xrl ms srtzn 3D oun omn, ts st s ru to on or two s. orrsponn prml sts tt ntrst otr r sown on t rt

4 sust o F su tt [ F n 8 2 F ) F == F : T st o xr nnt to ny n F orms t prml or rltv to. Som otr usul ntons or our purpos r ms surs n ms lns. Dnton 5 (Ms surs) Lt M = (H, F, E, N) ms srtzn oun omn X; ms sur o M s st o prws jnt s o F ormn 2-mnol. Dnton 6 (Ms lns) Lt M = (H, F, E, N) ms srtzn oun omn X; ms ln o M s st o prws jnt s o E ormn 1-mnol. Lt us now n 3D omtr ojt n BRp rprsntton. In, n n nustrl n prmt ontxt, t 3D oun-omns w wnt to srtz r nrlly rprsnt y su ounry rprsnttons. Dnton 7 (BRp rprsntton o 3D omtr ojt) A 3D omtr ojt s 3-tupl (S,C,V) wr 1. S s non-mpty st o omtr surs nlosn 3D sp n su tt 8ðs 1 ; s 2 Þ2S 2 ; s 1 \ s 2 ¼;; 2. C s t non-mpty st o urvs nnt to on or mor surs n S; 3. V s t non-mpty st o vrts nnt to on or mor surs n S. Consrn ts nton, w n now ssot omtr surs n omtr urvs, rsptvly, to ms surs n ms lns. Ts ssoton s n xtnson o t lsston 3 noton ntrou y Rml n Spr [29] or mss. Dnton 8 (Gomtr ssoton) Lt M = (H, F, E, N) xrl ms srtzn t BRp omtr ojt G = (S, C, V). A ms sur s M F s ssot wt omtr sur s [ S n only ll t s n s M, ll t s n nos jnt to o s M r omtrlly on sur s wtn tolrn, n s M srtzs sur s (.., vry pont x [ s s ontn n xtly on, [ s M, n s M wolly lls s). A ms ln l M E s ssot wt omtr urv [ C n only ll t s n l M n ll t nos jnt to n o l M r omtrlly on urv wtn tolrn, n l M srtzs urv (.., vry pont x [ s ontn n xtly on, [ l M, n l M wolly lls ). 3 In topoloy-s moln ts noton s ll mn. Impltly, ts nton nts tt two omtr surs s 1 n s 2 o BRp omtr ojt sr urv, tn t s o t ms ln ssot wt urv r ot ssot wt surs s 1 n s 2 too. 2.2 Funmntl xrl mss Typlly, nlysts rqur oo sp n topoloy o xr nr t ounry o 3D ojts. Tt s t rson wy ns-out lortms [10 12] r not sutl or mny numrl smultons. In t, ns-outs r normlly post-pross wt t nsrton o sts lon t ounry to t ttr sp xr [12]. T nton o unmntl mss s n ttmpt to rtrz wt t mns or ms to v wll-sp xr nr t ounry. T rst nton o unmntl mss ws vn y Spr [27] n tl y Loux n Spr [30]. Intutvly, n ts ntons, w onsr tt xrl ms s unmntl n only vry omtr sur s oun or ptur y snl prml st n vry omtr urv s oun or ptur y on or mor prlll prml ors. In ts ppr, w propos tortl lsston o t prml sts prtptn n t omtry ptur prour. In ts wy, w otn mor omplt nton o unmntl ms tn t ons vn y Loux n Spr [25] Cptur o omtr surs In orr to n t noton o unmntl prml sts, w ntrou t nton o pturn o omtr surs. Dnton 9 (Prml st pturn omtr sur) Lt M = (H, F, E, N) xrl ms o 3D omtr ojt G = (S, C, V), lt s G [ S omtr sur o G n s M F t qurltrl sur ms ssot wt s G, lt H s t st o ll t xr nnt to o s M, prml st P s st pturn s G n only H s P n P s smply onnt lolly to sur s G. T rst onton nsurs tt t omtr sur s ptur y snl prml st. For nstn you onsr F. 4, ll t xr trvrs y t r ul st r lon snl urv sur. In otr wors, ts omtr sur s ptur y t orrsponn prml st. In F. 4, ts sur s prtlly ptur y sx prml sts. Son onton urnts tt t orrsponn ul st s lolly 2-mnol. Ts son proprty s ssntl to vo prtulr ss smlr to t 2D s sown n F. 5.

5 F. 4 A snl st pturs snl omtr sur n, wl svrl sts ptur t n. Courtsy o Json Spr, Sn Ntonl Ls [27] F. 6 A lvl 1 un st pturs on omtr sur; t pturs tr omtr surs jnt to urv G lon to snl prml or. Ts nton sps notn out t xr vn n ssot wt urv G ut no s on t omtr ounry. In, ny numr o ors n unmntl to t sm omtr urv Funmntl sts F. 5 2D Exmpl o sl-ntrstn st tt pturs t top sur wtout stsyn t son onton o Dnton Funmntl ors In orr to n wt unmntl ms s, Loux n Spr [30] ntrou t notons o unmntl prml ors n unmntl prml sts. In tr ntons, unmntl prml sts orrspon to t nton o prml sts pturn omtr sur (Dnton 9), wl unmntl prml ors r prml ors prtptn to ptur omtr urv n vn som o tr s ssot wt omtr sur jnt to t omtr urv to ptur. Dnton 10 (Funmntl prml or) Lt M = (H, F, E, N) xrl ms o 3D omtr ojt G = (S, C, V), lt G [ C omtr urv o G n ðs G1 ; s G2 Þ2S 2 t jnt surs o G. Lt ðf G1 ; F G2 ÞF 2 t sts o s jnt to G n lonn to s G1 n s G2 ; rsptvly, lt H H t st o ll t xr srn o F G1 (rsptvly F G2 ), prml or H s unmntl prml or o G ssot wt s G1 (rsptvly s G2 ) n only H s nlu nto n s smply onnt lolly to urv G. Ts nton vs us rlton twn omtr urvs n prml ors tt s quvlnt to t rlton twn omtr surs n prml sts w n n Dnton 9. Intutvly, ts nton nsurs tt you onsr omtr urv G lmtn two omtr surs, tn, on ot surs, qurltrls W now nn t nton o unmntl sts, ornlly propos y Loux n Spr [30] y sutorzn tm nto tr lvls. T sts o t unmntl rst lvl v t rtrst o n wolly jnt to t omtr ounry. To smply, w nm tm lvl 1 un sts. 4 Dnton 11 (lvl 1 un st) Lt M = (H, F, E, N) xrl ms o 3D omtrl ojt G = (S, C, V), lt s G [ S omtr sur o G n s M F t qurltrl sur ms orrsponn to s G, lt H s t st o ll t xr srn o s M. A prml st P s lvl 1 un st or s G n only P pturs s G n vry xron [ P - H s prtpts to ptur notr omtr sur o G. T rst onton nsurs tt st P pturs omtr sur s G, wl son onton nsurs tr P only pturs s G ( P = H s )orp pturs on or mor omtr surs o G. As onsqun, tr xsts on-to-mny mppn rom t lvl 1 unmntl prml sts o H to t omtr surs o G. Fur 6 sows xmpls o lvl 1 un sts: In F. 6, t rprsnt prml st pturs on omtr sur, wl n F. 6 t pturs tr omtr surs. Alon, lvl 1 un sts r not sunt to n ll possl unmntl prml sts. W lvl 2 un sts tt r prml sts pturn t lst on omtr sur n n not lvl 1 unmntl sts. It mns tt som xr ormn lvl 2 un st o 4 W opt t sm nmn or son n tr lvls o unmntl prml sts.

6 F. 8 Two lvl 3 un sts prtptn to ptur t sm omtr urv. E o ts st s rltv to omtr sur jnt to t ptur omtr F. 7 On t lt, t lvl 2 un st pturs on omtr sur; on t rt, two omtr surs r ptur y t sm lvl 2 un st A lvl 3 un st lps to ptur on or mor omtr urvs. not prtpt n t ptur o omtr sur. For xmpl, F. 7 llustrts two sts, ot o w ontn xr ntror to t volum w r not ssot wt ny omtr sur. Dnton 12 (lvl 2 un st) Lt M = (H, F, E, N) xrl ms o 3D omtrt to ny omtr sur, ojt G = (S, C, V), lt s G [ S omtr sur o G. A prml st P s lvl 2 un st or s G n only P pturs s G n P s not lvl 1 un st. Lvl 1 n 2 un sts r qut to ptur ll omtr surs. Howvr, to ptur ll omtr urvs, w lvl 3 un sts. Dnton 13 (lvl 3 un st) Lt M = (H, F, E, N) xrl ms o 3D omtr ojt G = (S, C, V), n lt G [ G omtr urv o G. A prml st P s lvl 3 unmntl prml st or G n only tr xsts unmntl or n lvl 1 or lvl 2 un st P 2 su tt s t ntrston o P n P 2. Comprn to lvl 1 n lvl 2 un sts, lvl 3 un sts just lp to ptur omtr urvs n not omtr surs. T two sts llustrt n F. 8 r only jnt to ounry s lon t omtr urv ty lp to ptur. Not tt prml st n ot lvl 2 n lvl 3 un st. In, t nton o su prml sts s mnly lol to omtr sur (lvls 1 n 2) or omtr urv (lvl 3). As onsqun, prml st n ptur ot on or mor omtr surs n on or mor non-nnt omtr urvs. To onlu ts ston out unmntl sts, w summrz t mportnt turs tt stnus our tr lvls o un sts: A lvl 1 un st pturs on or mny omtr surs, n ll ts xr r on t ounry; A lvl 2 un st pturs on or mny omtr surs, ut som o ts xr o not prtpt n t ptur o omtr sur; 2.3 Funmntl ms Consrn t tr lvl o unmntl sts n prvously, w n now n wt unmntl ms s Dnton 14 (Funmntl ms) Lt M xrl ms o 3D omtr ojt G = (S, C, V), M s unmntl ms o G n only 1. All omtr surs n S r ptur y lvl 1 or lvl 2 un sts n M; 2. All omtr urvs n S r ptur y lvl 3 un sts n M. Ts nton ormlzs wt w xpt rom xrl ms srtzn omtr ojt: tr xsts t lst on prml st lon omtr surs, n omtr urvs r lso wll-ptur. 3 Gnrton o xrl lok-strutur mss usn unmntl sts Consrn Dnton 14 o unmntl mss, w propos n lortm or nrtn unmntl mss or 3D omtr ojts vn 3- n 4-vlnt omtr vrts. Dnton 14 o unmntl ms s only s on t noton o unmntl sts. As onsqun, w n wrt n lortm nrtn unmntl mss y only onsrn sts n not ors. Wt only t prvous lmt nton o unmntl sts prov y Loux n Spr [30], t ws ult to vlop onstrutv lortm w woul nrt -qulty lmnts vn on smpl onv ojts. Howvr, t nn nton o unmntl sts prov n St. 3, provs t rounwork nssry or su onstrutv lortm. Strtn rom 3D omtr ojt G = (S, C, V), t prnpl o our onstrutv lortm s s ollows (s F. 9):

7 1. Trnsorm n ntl ttrrl ms o G (s F. 9) nto n ll x ms, M = (H, F, E, N) usn t THx tmplt [31]. T qulty o ts ntrmt ms wll nsunt or most numrl smultons. 2. Dn tr sts ðs 1 ; S 2 ; S 3 Þ o unmntl sts, rsptvly, orrsponn to lvl 1, 2, n 3 un sts y solvn lol topoloy onstrnt stston systm. 3. Dn st, S s ontnn ll non-unmntl (.., sonry) sts n M. 4. On-y-on, nsrt unmntl st, s 2ðS 1 [ S 2 [ S 3 Þ; nto M usn t pllow oprton [32]. Ts oprton onssts n ntroun prml st lon sust o F ormn 2-mnol sur. At ts stp, w t unmntl ms o G (s F. 9, wr Lpln smootn lortm s n ppl). 5. On-y-on, xtrt non-unmntl st, s j 2 S s usn t st xtrton oprton [33] to rt strutur lok xrl ms (s F. 9 ). T ulty s to v roust mplmntton o t xtrton oprton. In, wr n trky sts n our urn st xtrton. Morovr, n som spl ss w o not rmov ll t sonry sts. For nstn, you onsr spr, you just v on un st tt os not sl-ntrst. A x s t ntrston o tr sts. Tus, you rmov ll t sts ut t on unmntl st, you o not kp ny xron. 6. Rn lok to t sr nsty. In ts ston, w ous on Itm 2, w s t rt o t lortm. T two mn ssus tt n to onsr r: 1. T mnmnt o vrts wt vln rtr tn 3. In ts ppr, w rstrt our ous to 4-vlnt vrts; 2. T trmnton o t nsrton pt o ntrnl prml sts (lvl 2 n 3) ns t omtr volum. F. 9 In ts ur, r vn rnt stps o our lortm. W nrt ttrrl ms o our omtr ojt; ts ttrrl ms s onvrt nto THx ms y pplyn t trtnl pttrn trnormn ttrron nto our xr; unmntl sts r nsrt to t unmntl ms; Lpln smootn lortm s ppl; rsults o sussv xtrtons o prml sts to t lok-strutur xrl ms n. All t xtrtons r not sown. In ts xmpl, 16 xtrtons r nssry ntrston o two lvl 1 un sts,.., on snl prml or, n vrtx s ptur y tr lvl 1 un sts,.., on snl xron. Fur 10 sows n xmpl o su s. T prolm s wn you v to l wt non-onvx omtrs n/or r vlnt omtr 1 un sts (rprsnt y t rn, yllow n r ul sts) w prws ntrst lon omtr urvs to orm prml ors vrts. In, t lst n - 2 xr 3.1 On t ounry: mnmnt o 4-vlnt vrts T nsrton o unmntl sts n ors prov xplt ptur o omtr urvs n surs. But wt out omtr vrts? In t, tr s no sp rqurmnt or omtr vrts, w r ptur y on or mny xr. For onvx omtrs wt only 3-vlnt vrts, w n put on lvl 1 un st pr omtr sur. Tn urv s ptur y t F. 10 T omtr vrtx s ptur y snl xron, w s t ntrston o tr lvl 1 un sts (rprsnt y t rn, yllow, n r ul sts) w prws ntrst lon omtr urvs to orm prml ors (olor ur onln)

8 r nssry to ptur n-vlnt onvx omtr vrtx [27, 34]. In ts ppr, w lmt our ous to t 4-vlnt vrts onurtons vn n F. 11. In, two xr ptur on omtr vrtx, wl our xr ptur t n n. T onsqun s tt lvl 1 un sts r not sunt to ptur 4-vlnt omtr vrts. In t two prvous ss, w v: 1. In, two xr r nrt y two lvl 1 un sts (rn n yllow ul sts) n two lvl 3 un sts (lu n r ons); 2. In n, our xr r nrt y on lvl 1 un st (r ul st) n our lvl 3 un sts (ry, lu, yllow, n rn ons). Tr s no xplt rrn to omtr vrts n t unmntl ms nton, ut ty v mportnt rstrtons n t mnnr to n t unmntl sts to nsrt. Morovr, t lol topolol strutur o xrl mss nors t onton wr t lol onurton t vrts must propt lon t jnt urvs n surs. For nstn, onsr F. 12 wr 4-s s pyrm s rprsnt. W ous on t ln smnt jonn t 4-vlnt top vrtx n t 3-vlnt ront vrtx o t s. Altou t s 3-vlnt, ts vrtx nnot ptur y snl xron u to t propton o onstrnts mntn rom t top vrtx, w s ptur y two xr. I w onsr un sts, ts two xr r nrt y two lvl 1 un st n two lvl 3 un sts s llustrt n F. 12. T onstrnts tt r propt lon omtr urvs n ntrprt s onstrnts on t omtr urvs tmslvs. Mor prsly, w n tr typs o urvs: Typ 1 T urv s lolly ptur y two lvl 1 un sts (s F. 13); Typ 2 T urv s lolly ptur y on lvl 1 un st n two lvl 3 un sts (s F. 13); Typ 3 T urv s lolly ptur y two lvl 2 un sts n two lvl 3 un sts (s F. 13). T lolty trm n ts tr ss s u to t t tt, lolly to urv, t s mpossl to stnus F. 12 Propton o omtr vrts onstrnts lon omtr urvs. A omplt pyrm s sown n, wl ous on t ln smnt jonn t top vrtx n t ront vrtx o t s s vn n lvl 1 rom lvl 2 un st n lvl 3 rom lvl 2 un st. Morovr, propton o onstrnts lon omtr urvs n surs n moy ts lsston. W v lrtly slt only tr typs o urvs to t qut smpl lortm. Extnsons o ts lortm wll proly l to ntrou som otr typs o urvs. Vrts lso v prsr st o vl onurtons. In ts ppr, w lmt our ous to t ollown: Typ V3A A 3-vlnt vrtx wt ll jnt urvs o Typ 1 (s F. 10); Typ V3B A 3-vlnt vrtx wt two jnt Typ 1 urvs n on jnt Typ 2 urv; Typ V3C A 3-vlnt vrtx wt ll jnt urvs o Typ 3; Typ V3D A 3-vlnt vrtx wt two jnt Typ 3 urvs n on jnt Typ 2 urv; Typ V4A A 4-vlnt vrtx wt two oppost jnt urvs o Typ 1 n t otr two oppost jnt urvs o Typ 2 (s F. 11); Typ V4B A 4-vlnt vrtx wt two oppost jnt urvs o Typ 1 n t otr two oppost jnt urvs o Typ 3 (s F. 11); Typ V4C A 4-vlnt vrtx wt two oppost jnt urvs o Typ 2 n t otr two oppost jnt urvs o Typ 3 (s F. 11); Typ V4D A 4-vlnt vrtx wt ll jnt urvs o Typ 2 (s F. 11); Typ V4E A 4-vlnt vrtx wt ll jnt urvs o Typ 3 (s F. 11). F. 11 A 4-vlnt omtr vrtx s r ptur y two xr () or our xr (, ). In, t our xr r sown; wrs n, t orrsponn ul sts r rprsnt

9 F. 13 T tr typs o urvs w nl. A Typ 1 urv s ptur y two lvl 1 un sts n orrspons to snl unmntl or. A Typ 2 urv s ptur y on lvl 1 un st n two lvl 2 un sts n orrspons to two unmntl ors. A Typ 3 urv s ptur y two lvl 2 un sts n two lvl 3 un sts n orrspons to tr unmntl ors As n t s o urvs, t s mpossl to stnus, lolly to vrtx, lvl 1 rom lvl 2 un st n lvl 3 rom lvl 2 un st. Tt s t rson wy w v t sm lol onurtons o xr roun vrts o typs V4A, V4B, n V4C on on n, n V4D n V4E on t otr n. As sr ltr n ts ppr, t lsston Typ ssn to omtr urv s mo untl ll omtr vrts n t mol mt on o ts vrtx typs. 3.2 Ins t volum: propton o ntrnl prml sts Lvl 2 n 3 un sts propt ns t ms. It must trmn wr ts sts r pl n ow ty n onnt totr ns t ms. For xmpl, onsr t 2D xmpl n F. 14. T pts o lvl 1 un sts (lu) v n ompltly trmn. Hnn wskrs rprsnt our prtlly n lvl 2 un sts (r) n our prtlly n lvl 3 un sts (rn). T ol o our lortm s to trmn ow ts nn wskrs r pr n t pt trvrs to pr tm. Drnt solutons n slt lk solutons A, B, n C prsnt n F. 14. Altou not t prmry ous o ts ppr, w must trmn t sptl pt o t un sts s ty propt nto t volum. In our urrnt lortm, ts propton s s on omtr rtr n ollows plnr projtons o ounry normls. In spt o t lmttons o ts smpl ppro, t llows us to nrt ms y onsrn lol proprts n not just lol proprts. Ts pont s rul; on o t mn ults n xrl msn s to norport qut onsrton o t lol topolol strutur o xrl mss. 3.3 Our lortm: rom ounry to ns T propos lortm s s on lsston o omtr vrts n urvs. As xpln n St. 3.1, F. 14 In 2D, un st onnton onssts n onntn un ors. For ts xmpl, tr solutons o t mny possl solutons r llustrt. Soluton B sms to t xpt on or most usrs onstrnts on vrts r mnly propt lon urvs. Ts propton ls to lsston o urvs nto tr tors wl w lssy omtr vrts y onsrn tr vln. T skt o t lortm trmnn t sts to nsrt s s ollows: 1. W ntlz vry urv to Typ 1 t s onvx or Typ 3 otrws; 2. Tn w trmn w vrts r nvl (.., o not mt on o t vrtx lsston Typs: V3A, V3B, t.); 3. W trtvly n urv lsston Typs, on t tm, untl ll nvl vrts mt on o t vrtx lsston Typs. Ts n tmporrly nvlt som ntlly vl vrts; 4. Fnlly, w omtrlly los som yls o Typ 2 urvs tt wr rt urn t prvous stp. To los ts yls, w us omtr ntrston (urrntly st o plns), n w n som vrtul urvs. W now llustrt n tl ts lortm on t omtr ojt vn n F. 15. T rst stp o t lortm onssts o ssnn n ntl strtn lsston

10 to vry omtr urv. In F. 15, t omtr ojt s onvx; tus, ll t s r ntlly o Typ 1. For onvnn, Typ 1 urvs r rwn n lk, n Typ 2 urvs r rwn n r n F. 15. Nxt, vrtx s nlyz to s w vrtx Typ ty r (V3A, V3B, t.). In F. 15, non o t 4-vlnt vrts mt ny o t vrtx lsstons n r tus to lst, V,o nvl vrts: V ¼; ; ; ; : T prnpl ol o t lortm s to moy t Typ lsstons o urvs, on-y-on untl vrtx mts on o t vl vrtx typs (V3A, V3B, t.). In our xmpl, to mk vrtx vl, w v to n t Typ lsston o t lst two oppost urvs jnt to t. T rsultn onurton s pt n F. 15 wr Typ 2 urvs r rwn n r. In ts nw onurton, vrtx s ptur y two xr n s o Typ V4A. T lst o nvl vrts oms tn: V ¼; ; ; : T nxt vrtx to l wt s vrtx. Cnn t Typ lsston o [, ] to Typ 2 wll mk vrtx Typ V4A n tror vl (s F. 15). Now, vrts n r, rsptvly, ptur y two xr. Lst V s tn {,, }. T sm moton s prorm roun vrtx to t t onurton o F. 15 n V = {, }. Nxt, solvn t nvl onurton t vrtx n on y tr rlssyn urvs [, ] n [, ] to Typ 2 urvs or y rlssyn urvs [, ] n [, ] to Typ 2 urvs. Our lortm slts t rst opton to t t onurton n F. 15. V = {, } sn vrtx s no lonr vl. Vrtx s m vl y urv [, ] to om Typ 2 urv (s F. 15). Vrtx s tn ptur y our xr n s now Typ V4D. Lst V s ru to {}. Fnlly, vrtx oms vl y rlssyn urv [, ] to Typ 2 urv (s F. 15). W otn two opn yls o Typ 2 urvs n F. 15: t rst on strts n vrtx to n n vrtx, t lttr on strts n vrtx to n n vrtx. Ty v to los us yl orrspons to splt t omtr ojt n two volums y nsrtn two lvl 3 sts lon t yl. W los ot yls y onsrn t t tt tr n vrts r on t sm omtr sur (tus w smply vrtul urv to los yl), n w t rsult o F. 15. I t n vrts r not on t sm omtr sur, w rt svrl plns n y t vrts o t opn yl, n w us ts st o plns to rv t lvl 3 un sts nsrtons. Ts nsrtons, s ll t st nsrtons w prorm, r m rtly n t THx ms o t ntl omtr ojt. W t rsult o F. 16. Not tt our urrnt lortm s ry lortm tt mks os twn rnt possl solutons t mny stps n t lortm. Ts sons n l to rnt vl unmntl mss. Tus, n most ss, tr s not unqu soluton n pns on t mto us or rsolvn non-vl onurtons. For nstn, n t prvous xmpl, w my not t t sm rsult w strt t lortm y xn t nvl onurton n vrtx nst o vrtx. F. 15 Smpl xmpl sown ow w trmn t typ o t omtr urvs n orr to x nvl onurtons roun omtr vrts

11 F. 16 T ms tr vn nsrt t un sts n prvously; two lvl 3 un sts nsrt lon t sm Typ 2 urv r xt; t rsultn lokstrutur xrl ms s sown F. 17 T omtry o ts xmpl s t sm s t prvous xmpl, ut ornr ws rmov to t nononvx omtry. T rsultn strutur-lok xrl onurton s prsnt wt two rnt ponts o vw n two srnkn prmtrs F. 18 T non-swpl omtry to ms;, t nrt strutur-lok xrl ms n two ponts o vw l wt non-onvx omtrs vn 4-vlnt omtr vrts. 4 Conluson n utur works F. 19 T omtry to ms s sown n ; n, w t t rsultn lok-strutur xrl ms; nl xrl ms wr vry lok s n rms s sown (Not tt t Lpln smootn us n ts xmpl os not prov t st omtr rsults) 3.4 Exmpls Furs 17, 18, n 19 prov som rsults otn wt t propos lortm. Ty sow tt t lortm n T mn ulty to ovrom n xrl msn s tt xrl mss v lol topolol strutur tt ny msn lortm must tk nto ount. Ts rtrst s vry rstrtv n xplns wy w nnot just onsr lol onurtons. In ts work, w v propos mor omplt nton o unmntl mss. Ts nton s s on lsston o unmntl sts n tr lvls n llows us to lnk omtr onsrtons n topolol strutur o xrl mss. W lv tt t provs stron ounton to ul upon n orr to nrt xrl ms or ny omtr ojt wt wll-sp xr lon t omtr ounry. Strtn rom t nton o unmntl mss, w v propos n lortm to ms ny omtr ojt

12 vn only 3- or 4-vlnt vrts. Ts prlmnry lortm s qut smpl ut provs mprssv prlmnry rsults. It srvs to xtn to mor omtr ojts (wt r vln vrts). Ts xtnson wll proly rqur tonl omtr urv n vrtx lsston Typs, n t wll rtnly n to onsr ttr wy to propt sts ns t volum. Ts work wll l to solvn t omtr omposton ssu. Coupl wt onsrton o lol topoloy, t us o tnsor ls [35] mt us to u t nsrton pts o lvl 2 n 3 un sts. Ts wll l to n lortm usn wll-known ppros su s lo prormmn. Su ppros wll lso lpul to t t st lok omposton n not just t rst oun lok omposton otn y our urrnt ry lortm. Aknowlmnts T utors ws to knowl t work o Json Spr n provn som o t ountonl onpts n ts work n or s nstul ommnts ovr t yrs n t r o ul-s xrl ms nrton. W lso ws to knowl sponsorsp rom t prormn omputn ntrntonl ollorton twn t US Dprtmnt o Enry, Ntonl Nulr Surty Amnstrton n t Frn Commssrt à l Enr Atomqu unr t rton o Rort Msnr (NNSA) n Jn Gonnr (CEA/DAM). Rrns 1. Loux F, Wll J-C, Brtrn Y (2010) Dnton o nr ms t strutur n t prormn omputn ontxt. In: Dvlopmnts n ppltons n nnrn omputtonl tnoloy, vol 26. Sx-Cour Pultons, pp Blkr TD, Myrs RJ (1993) Sms n ws n plstrn: 3D xrl ms nrton lortm. En Comput 2(9): Own S, Sunl S (2000) H-morp: n nrt ppro to vnn ront x msn. Int J Numr Mtos En 1(49): Tuts TJ, Blkr TD, Mtll SA (1996) T wskr wvn lortm: onntvty-s mto or onstrutn ll-xrl nt lmnt mss. Int J Numr Mtos En 39: Folwll NT, Mtll SA (1998) Rll wskr wvn v urv ontrton. In: Prons o t 7t ntrntonl msn rountl, pp Mullr-Hnnmnn M (2001) Slln xrl omplxs or ms nrton. J Grp Alortm Appl 5(5): Cronr CD, Spr JF (2006) A onstrutv ppro to onstrn xrl ms nrton. In: Prons o t 15t ntrntonl msn rountl, Sptmr 2006, Sn Ntonl Lortors, pp Loux F, Wll J-C (2007) An xtnson o t rll wskr wvn lortm. In: Prons o t 16t ntrntonl msn rountl. Sprnr, Brln, pp Kwmur Y, Islmm MS, Sum Y (2008) A strty o utomt xrl ms nrton y usn n mprov wskrwvn mto wt sur ms moton prour. En Comput 24: Snrs R (1997) An lortm or t nrton o xrl lmnt mss s on otr tnqu. In: Prons o t 6t ntrntonl msn rountl, pp Mrél L (2009) Avns n otr-s ll-xrl ms nrton: nln srp turs. In: Clrk BW () Prons o t 18t ntrntonl msn rountl. Sprnr, Brln, pp Spr JF (2009) Conormn xrl ms nrton v omtr ptur mtos. In: Clrk BW () Prons o t 18t ntrntonl msn rountl. Sprnr, Brln, pp Sttn ML, Krr RA, Own SJ, Blkr TD, Stupzzn M, Sm K (2010) Unonstrn plstrn xrl ms nrton v vnn-ront omtry omposton. Int J Numr Mtos En 81: Muro P, Bnzly SE (1995) T sptl twst ontnuum: onntvty-s mto or rprsntn ll xrl nt lmnt mss. In: Prons o t 4t ntrntonl msn rountl, numr SAND , Aluqurqu, Sn Ntonl Lortors 15. Cut, omtry n ms nrton toolkt. ttp://ut.sn. ov 16. Blkr TD (1997) T oopr tool. In: Prons o t 5t ntrntonl msn rountl, pp Spr J, Mtll SA, Knupp P, Wt DR (2000) Mtos or multswp utomton. In: Prons o t 9t ntrntonl msn rountl, pp Ruz-Gronés E, Ro X, Srrt J (2009) A nw prour to omput mprnts n mult-swpn lortms. In: Clrk BW () Prons o t 18t ntrntonl msn rountl. Sprnr, Brln, pp ANSYS, ICEM CFD. ttp:// sp 20. Ro X, Srrt J (2008) Lol ul ontrutons on smpls: tool or lok msn. In: Prons o t 17t ntrntonl msn rountl. Sprnr, Brln, pp Brn M, Eppstn D, Erkson J (2002) Flppn ul mss. En Comput 18(3): Tuts TJ, Knoop SE (2003) Topoloy moton o xrl mss usn tom ul-s oprtons. In: Prons o t 12t ntrntonl msn rountl, Sptmr 2003, Sn Ntonl Lortors, pp Tuts TJ, Knoop SE, Rkmyr TJ (2008) Lol topolol motons o xrl mss. Prt I: A st o ul-s oprtons. In: ESAIM Prons CEMRACS 2007, vol 24, pp Jurkov K, Loux F, Kut R, Rkmyr T, Tuts TJ, Zort H (2007) Lol topolol motons o xrl mss. Prt II: Comntors n rlton to oy sur. In: ESAIM Prons CEMRACS 2007, vol 24, pp Loux F, Spr JF (2009) Topolol motons o xrl mss v st oprtons: tortl stuy. En Comput. o: /s Mtll SA (1996) A rtrzton o t qurltrl mss o sur w mt omptl xrl ms o t nlos volum. In: Prons o t 13t nnul symposum on tortl spts o omputr sn, pp Spr JF (2007) Topolo n omtr onstrnt-s xrl ms nrton. Puls Dotorl Dssrtton. Unvrsty o Ut, Ut 28. Sttn ML, Spr JF, Loux F, Sm K (2009) Hxrl ms mtn: onvrtn non-onormn xrl-toxrl ntrs nto onormn ntrs. Int J Numr Mtos En. o: /nm.2800

13 29. Rml J-F, Spr MS (2003) An lortm ornt ms ts. Int J Numr Mtos En 58(2) 30. Loux F, Spr JF (2009) Topolol n omtrl proprts o xrl mss. En Comput. o: / s Cry GF (2002) Hxn t tt. Commun Numr Mtos En 18(3): Mtll SA, Tuts TJ (1995) Pllown oults: rnn ms to nsur tt s sr t most on. In: Prons o t 4t ntrntonl msn rountl, Otor 1995, Sn Ntonl Lortors, pp Bnzly SE, Born MJ, Spr JF (2002) Hxrl st xtrton. In: Prons o t 11t ntrntonl msn rountl, pp Spr JF, Jonson CR (2008) Hxrl ms nrton onstrnts. En Comput 24(3): Vys V, Sm K (2009) Tnsor-u x-omnnt ms nrton wt trt ll-x rons. In: Clrk BW () Prons o t 18t ntrntonl msn rountl. Sprnr, Brln, pp

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees /1/018 W usully no strns y ssnn -lnt os to ll rtrs n t lpt (or mpl, 8-t on n ASCII). Howvr, rnt rtrs our wt rnt rquns, w n sv mmory n ru trnsmttl tm y usn vrl-lnt non. T s to ssn sortr os to rtrs tt our

More information

Lecture 20: Minimum Spanning Trees (CLRS 23)

Lecture 20: Minimum Spanning Trees (CLRS 23) Ltur 0: Mnmum Spnnn Trs (CLRS 3) Jun, 00 Grps Lst tm w n (wt) rps (unrt/rt) n ntrou s rp voulry (vrtx,, r, pt, onnt omponnts,... ) W lso suss jny lst n jny mtrx rprsntton W wll us jny lst rprsntton unlss

More information

Weighted Graphs. Weighted graphs may be either directed or undirected.

Weighted Graphs. Weighted graphs may be either directed or undirected. 1 In mny ppltons, o rp s n ssot numrl vlu, ll wt. Usully, t wts r nonntv ntrs. Wt rps my tr rt or unrt. T wt o n s otn rrr to s t "ost" o t. In ppltons, t wt my msur o t lnt o rout, t pty o ln, t nry rqur

More information

The University of Sydney MATH 2009

The University of Sydney MATH 2009 T Unvrsty o Syny MATH 2009 APH THEOY Tutorl 7 Solutons 2004 1. Lt t sonnt plnr rp sown. Drw ts ul, n t ul o t ul ( ). Sow tt s sonnt plnr rp, tn s onnt. Du tt ( ) s not somorp to. ( ) A onnt rp s on n

More information

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1 Spnnn Trs BFS, DFS spnnn tr Mnmum spnnn tr Mr 28, 2018 Cn Hrn / Gory Tn 1 Dpt-rst sr Vsts vrts lon snl pt s r s t n o, n tn ktrks to t rst junton n rsums own notr pt Mr 28, 2018 Cn Hrn / Gory Tn 2 Dpt-rst

More information

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Depth First Search. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong Dprtmnt o Computr Sn n Ennrn Cns Unvrsty o Hon Kon W v lry lrn rt rst sr (BFS). Toy, w wll suss ts sstr vrson : t pt rst sr (DFS) lortm. Our susson wll on n ous on rt rps, us t xtnson to unrt rps s strtorwr.

More information

(Minimum) Spanning Trees

(Minimum) Spanning Trees (Mnmum) Spnnn Trs Spnnn trs Kruskl's lortm Novmr 23, 2017 Cn Hrn / Gory Tn 1 Spnnn trs Gvn G = V, E, spnnn tr o G s onnt surp o G wt xtly V 1 s mnml sust o s tt onnts ll t vrts o G G = Spnnn trs Novmr

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Rll t nton o spnnn tr: Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Any unrt, onnt rp s spnnn tr. Atully, rp

More information

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano

Divided. diamonds. Mimic the look of facets in a bracelet that s deceptively deep RIGHT-ANGLE WEAVE. designed by Peggy Brinkman Matteliano RIGHT-ANGLE WEAVE Dv mons Mm t look o ts n rlt tt s ptvly p sn y Py Brnkmn Mttlno Dv your mons nto trnls o two or our olors. FCT-SCON0216_BNB66 2012 Klm Pulsn Co. Ts mtrl my not rprou n ny orm wtout prmsson

More information

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017

CMSC 451: Lecture 4 Bridges and 2-Edge Connectivity Thursday, Sep 7, 2017 Rn: Not ovr n or rns. CMSC 451: Ltr 4 Brs n 2-E Conntvty Trsy, Sp 7, 2017 Hr-Orr Grp Conntvty: (T ollown mtrl ppls only to nrt rps!) Lt G = (V, E) n onnt nrt rp. W otn ssm tt or rps r onnt, t somtms t

More information

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland

The R-Tree. Yufei Tao. ITEE University of Queensland. INFS4205/7205, Uni of Queensland Yu To ITEE Unvrsty o Qunsln W wll stuy nw strutur ll t R-tr, w n tout o s mult-mnsonl xtnson o t B-tr. T R-tr supports ntly vrty o qurs (s w wll n out ltr n t ours), n s mplmnt n numrous ts systms. Our

More information

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e)

Improving Union. Implementation. Union-by-size Code. Union-by-Size Find Analysis. Path Compression! Improving Find find(e) POW CSE 36: Dt Struturs Top #10 T Dynm (Equvln) Duo: Unon-y-Sz & Pt Comprsson Wk!! Luk MDowll Summr Qurtr 003 M! ZING Wt s Goo Mz? Mz Construton lortm Gvn: ollton o rooms V Conntons twn t rooms (ntlly

More information

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk

CMPS 2200 Fall Graphs. Carola Wenk. Slides courtesy of Charles Leiserson with changes and additions by Carola Wenk CMPS 2200 Fll 2017 Grps Crol Wnk Sls ourtsy o Crls Lsrson wt ns n tons y Crol Wnk 10/23/17 CMPS 2200 Intro. to Alortms 1 Grps Dnton. A rt rp (rp) G = (V, E) s n orr pr onsstn o st V o vrts (snulr: vrtx),

More information

Minimum Spanning Trees (CLRS 23)

Minimum Spanning Trees (CLRS 23) Mnmum Spnnn Trs (CLRS 3) T prolm Gvn onnt, unrt rp G = (V, E), sust o s o G su tt ty onnt ll vrts n G n orm no yls s ll spnnn tr (ST) o G. Clm: Any unrt, onnt rp s spnnn tr (n nrl rp my v mny spnnn trs).

More information

In which direction do compass needles always align? Why?

In which direction do compass needles always align? Why? AQA Trloy Unt 6.7 Mntsm n Eltromntsm - Hr 1 Complt t p ll: Mnt or s typ o or n t s stronst t t o t mnt. Tr r two typs o mnt pol: n. Wrt wt woul ppn twn t pols n o t mnt ntrtons low: Drw t mnt l lns on

More information

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling. Cptr 4 4 Intrvl Suln Gry Alortms Sls y Kvn Wyn Copyrt 005 Prson-Ason Wsly All rts rsrv Intrvl Suln Intrvl Suln: Gry Alortms Intrvl suln! Jo strts t s n nss t! Two os omptl ty on't ovrlp! Gol: n mxmum sust

More information

Graph Search (6A) Young Won Lim 5/18/18

Graph Search (6A) Young Won Lim 5/18/18 Grp Sr (6A) Youn Won Lm Copyrt () 2015 2018 Youn W. Lm. Prmon rnt to opy, trut n/or moy t oumnt unr t trm o t GNU Fr Doumntton Ln, Vron 1.2 or ny ltr vron pul y t Fr Sotwr Founton; wt no Invrnt Ston, no

More information

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall

Having a glimpse of some of the possibilities for solutions of linear systems, we move to methods of finding these solutions. The basic idea we shall Hvn lps o so o t posslts or solutons o lnr systs, w ov to tos o nn ts solutons. T s w sll us s to try to sply t syst y lntn so o t vrls n so ts qutons. Tus, w rr to t to s lnton. T prry oprton nvolv s

More information

2 Trees and Their Applications

2 Trees and Their Applications Trs n Tr Appltons. Proprts o trs.. Crtrzton o trs Dnton. A rp s ll yl (or orst) t ontns no yls. A onnt yl rp s ll tr. Quston. Cn n yl rp v loops or prlll s? Notton. I G = (V, E) s rp n E, tn G wll not

More information

Closed Monochromatic Bishops Tours

Closed Monochromatic Bishops Tours Cos Monoromt Bsops Tours Jo DMo Dprtmnt o Mtmts n Sttsts Knnsw Stt Unvrsty, Knnsw, Gor, 0, USA mo@nnsw.u My, 00 Astrt In ss, t sop s unqu s t s o to sn oor on t n wt or. Ts ms os tour n w t sop vsts vry

More information

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices. Cptr 11: Trs 11.1 - Introuton to Trs Dnton 1 (Tr). A tr s onnt unrt rp wt no sp ruts. Tor 1. An unrt rp s tr n ony tr s unqu sp pt twn ny two o ts vrts. Dnton 2. A root tr s tr n w on vrtx s n snt s t

More information

Isomorphism In Kinematic Chains

Isomorphism In Kinematic Chains Intrntonl Journl o Rsr n Ennrn n Sn (IJRES) ISSN (Onln): 0-, ISSN (Prnt): 0- www.rs.or Volum Issu ǁ My. 0 ǁ PP.0- Isomorpsm In Knmt Cns Dr.Al Hsn Asstt.Prossor, Dprtmnt o Mnl Ennrn, F/O- Ennrn & Tnoloy,

More information

Strongly connected components. Finding strongly-connected components

Strongly connected components. Finding strongly-connected components Stronly onnt omponnts Fnn stronly-onnt omponnts Tylr Moor stronly onnt omponnt s t mxml sust o rp wt rt pt twn ny two vrts SE 3353, SMU, Dlls, TX Ltur 9 Som sls rt y or pt rom Dr. Kvn Wyn. For mor normton

More information

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments

Platform Controls. 1-1 Joystick Controllers. Boom Up/Down Controller Adjustments Ston 7 - Rpr Prours Srv Mnul - Son Eton Pltorm Controls 1-1 Joystk Controllrs Mntnn oystk ontrollrs t t propr sttns s ssntl to s mn oprton. Evry oystk ontrollr soul oprt smootly n prov proportonl sp ontrol

More information

(4, 2)-choosability of planar graphs with forbidden structures

(4, 2)-choosability of planar graphs with forbidden structures (4, )-ooslty o plnr rps wt orn struturs Znr Brkkyzy 1 Crstopr Cox Ml Dryko 1 Krstn Honson 1 Mot Kumt 1 Brnr Lký 1, Ky Mssrsmt 1 Kvn Moss 1 Ktln Nowk 1 Kvn F. Plmowsk 1 Drrk Stol 1,4 Dmr 11, 015 Astrt All

More information

Lecture II: Minimium Spanning Tree Algorithms

Lecture II: Minimium Spanning Tree Algorithms Ltur II: Mnmum Spnnn Tr Alortms Dr Krn T. Hrly Dprtmnt o Computr Sn Unvrsty Coll Cork Aprl 0 KH (/0/) Ltur II: Mnmum Spnnn Tr Alortms Aprl 0 / 5 Mnmum Spnnn Trs Mnmum Spnnn Trs Spnnn Tr tr orm rom rp s

More information

CSE 332. Data Structures and Parallelism

CSE 332. Data Structures and Parallelism Am Blnk Ltur 20 Wntr 2017 CSE 332 Dt Struturs n Prlllsm CSE 332: Dt Struturs n Prlllsm Grps 1: Wt s Grp? DFS n BFS LnkLsts r to Trs s Trs r to... 1 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus,

More information

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms CS 542 Avn Dt Stutu n Alotm Exm 2 Soluton Jontn Tun 4/2/202. (5 ont) Con n oton on t tton t tutu n w t n t 2 no. Wt t mllt num o no tt t tton t tutu oul ontn. Exln you nw. Sn n mut n you o u t n t, t n

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 19 Summr 2015 CSE 332: Dt Astrtons CSE 332 Grps 1: Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... 1 A Grp s Tny... 2 Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps,

More information

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017

COMP 250. Lecture 29. graph traversal. Nov. 15/16, 2017 COMP 250 Ltur 29 rp trvrsl Nov. 15/16, 2017 1 Toy Rursv rp trvrsl pt rst Non-rursv rp trvrsl pt rst rt rst 2 Hs up! Tr wr w mstks n t sls or S. 001 or toy s ltur. So you r ollown t ltur rorns n usn ts

More information

23 Minimum Spanning Trees

23 Minimum Spanning Trees 3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o

More information

An Introduction to Clique Minimal Separator Decomposition

An Introduction to Clique Minimal Separator Decomposition Alortms 2010, 3, 197-215; o:10.3390/3020197 Rvw OPEN ACCESS lortms ISSN 1999-4893 www.mp.om/ournl/lortms An Introuton to Clqu Mnml Sprtor Domposton Ann Brry 1,, Romn Poorln 1 n Gnvèv Smont 2 1 LIMOS UMR

More information

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H

The Constrained Longest Common Subsequence Problem. Rotem.R and Rotem.H T Constrn Lonst Common Susqun Prolm Rotm.R n Rotm.H Prsntton Outln. LCS Alortm Rmnr Uss o LCS Alortm T CLCS Prolm Introuton Motvton For CLCS Alortm T CLCS Prolm Nïv Alortm T CLCS Alortm A Dynm Prormmn

More information

A Simple Method for Identifying Compelled Edges in DAGs

A Simple Method for Identifying Compelled Edges in DAGs A Smpl Mto or Intyn Compll Es n DAGs S.K.M. Won n D. Wu Dprtmnt o Computr Sn Unvrsty o Rn Rn Ssktwn Cn S4S 0A2 Eml: {won, nwu}@s.urn. Astrt Intyn ompll s s mportnt n lrnn t strutur (.., t DAG) o Bysn ntwork.

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

Single Source Shortest Paths (with Positive Weights)

Single Source Shortest Paths (with Positive Weights) Snl Sour Sortst Pts (wt Postv Wts) Yuf To ITEE Unvrsty of Qunslnd In ts ltur, w wll rvst t snl sour sortst pt (SSSP) problm. Rll tt w v lrdy lrnd tt t BFS lortm solvs t problm ffntly wn ll t ds v t sm

More information

d e c b a d c b a d e c b a a c a d c c e b

d e c b a d c b a d e c b a a c a d c c e b FLAT PEYOTE STITCH Bin y mkin stoppr -- sw trou n pull it lon t tr until it is out 6 rom t n. Sw trou t in witout splittin t tr. You soul l to sli it up n own t tr ut it will sty in pl wn lt lon. Evn-Count

More information

Applications of trees

Applications of trees Trs Apptons o trs Orgnzton rts Attk trs to syst Anyss o tr ntworks Prsng xprssons Trs (rtrv o norton) Don-n strutur Mutstng Dstnton-s orwrng Trnsprnt swts Forwrng ts o prxs t routrs Struturs or nt pntton

More information

MATERIAL SEE BOM ANGLES = 2 FINISH N/A

MATERIAL SEE BOM ANGLES = 2 FINISH N/A 9 NOTS:. SSML N NSPT PR SOP 0-9... NSTLL K STKR N X L STKR TO NS O SROU WT TP. 3. PR-PK LNR RNS WT P (XTRM PRSSUR NL R ) RS OR NNRN PPROV QUVLNT. 4. OLOR TT Y T SLS ORR. RRN T MNS OM OR OMPONNTS ONTNN

More information

Graphs Depth First Search

Graphs Depth First Search Grp Dpt Frt Sr SFO 337 LAX 1843 1743 1233 802 DFW ORD - 1 - Grp Sr Aort - 2 - Outo Ø By unrtnn t tur, you ou to: q L rp orn to t orr n w vrt r ovr, xpor ro n n n pt-rt r. q Cy o t pt-rt r tr,, orwr n ro

More information

Dental PBRN Study: Reasons for replacement or repair of dental restorations

Dental PBRN Study: Reasons for replacement or repair of dental restorations Dntl PBRN Stuy: Rsons or rplmnt or rpr o ntl rstortons Us ts Dt Collton Form wnvr stuy rstorton s rpl or rpr. For nrollmnt n t ollton you my rpl or rpr up to 4 rstortons, on t sm ptnt, urn snl vst. You

More information

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks.

Data-Parallel Primitives for Spatial Operations Using PM. Quadtrees* primitives that are used to construct the data. concluding remarks. Dt-rlll rmtvs or Sptl Oprtons Usn M Qutrs* Erk G. Hol Hnn Smt Computr Sn Dprtmnt Computr Sn Dprtmnt Cntr or Automton Rsr Cntr or Automton Rsr Insttut or Avn Computr Sns Insttut or Avn Computr Sns Unvrsty

More information

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

PRECAST APPROACH SLAB NOTES

PRECAST APPROACH SLAB NOTES ULNS TS ULN RWNS RPRSNT TYPL TLS OR T SN N TLN O PRST PPRO SLS. TS STS R NLU TO PROV N XMPL O T RTN LYOUT O TYPL PRST PPRO SL. TWO RNT PPRO SL SYSTMS R SOWN: SUR PPRO SLS: SLS TT R PL WT T TOP SUR T OR

More information

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2

CSE 332. Graphs 1: What is a Graph? DFS and BFS. Data Abstractions. CSE 332: Data Abstractions. A Graph is a Thingy... 2 Am Blnk Ltur 0 Autumn 0 CSE 33: Dt Astrtons CSE 33 Grps : Wt s Grp? DFS n BFS Dt Astrtons LnkLsts r to Trs s Trs r to... A Grp s Tny... Wr W v Bn Essntl ADTs: Lsts, Stks, Quus, Prorty Quus, Hps, Vnll Trs,

More information

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010

Phylogenetic Tree Inferences Using Quartet Splits. Kevin Michael Hathcock. Bachelor of Science Lenoir-Rhyne University 2010 Pylont Tr Inrns Usn Qurtt Splts By Kvn Ml Htok Blor o Sn Lnor-Ryn Unvrsty 2010 Sumtt n Prtl Fulllmnt o t Rqurmnts or t Dr o Mstr o Sn n Mtmts Coll o Arts n Sns Unvrsty o Sout Croln 2012 Apt y: Év Czrk,

More information

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview:

Introduction to Fourier optics. Textbook: Goodman (chapters 2-4) Overview: Introuton to ourr opts Ttbook: Goon (ptrs -) Ovrv: nr n nvrnt ssts T ourr trnsor Slr rton rsnl n runor pprotons. . nr ssts n ourr trnsor tutorl (rnr) sst onnts n nput to n output su tt: It s s to b lnr

More information

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query

An Application to Search for High-Priority War Opponent in Spatial Games Using Dynamic Skyline Query Intrntonl Journl o Appl Ennrn Rsr ISSN 973-4562 Volum 13, Numr 2 (218) pp. 1496-15 An Applton to Sr or H-Prorty Wr Opponnt n Sptl Gms Usn Qury Jonwn Km Smt Lrl Arts Coll, Smyook Unvrsty, 815 Hwrn-ro, Nowon-u,

More information

Institute for Advanced Computer Sciences. Abstract. are described for building these three data structures that make use of these

Institute for Advanced Computer Sciences. Abstract. are described for building these three data structures that make use of these Dt-Prlll Prmtvs or Sptl Oprtons Erk G. Holy Computr Sn Dprtmnt Unvrsty o Mryln Coll Prk, Mryln 074 ol@s.um.u Hnn Smt Computr Sn Dprtmnt Cntr or Automton Rsr Insttut or Avn Computr Sns Unvrsty o Mryln Coll

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

One-Dimensional Computational Topology

One-Dimensional Computational Topology Wr rltn so n Stz: Dnn un nur nn, wnn s Sm s Grpn I) ur nn Umsltunsoprton U n BZ-R lrt, II) ur Umrunsoprton wr us r BZ-R ntstt, stllt s Sm nn u r Kullä rlsrrn Grpn r. Dmt st n Gusss Prolm ür n llmnstn Grpn

More information

On Hamiltonian Tetrahedralizations Of Convex Polyhedra

On Hamiltonian Tetrahedralizations Of Convex Polyhedra O Ht Ttrrzts O Cvx Pyr Frs C 1 Q-Hu D 2 C A W 3 1 Dprtt Cputr S T Uvrsty H K, H K, C. E: @s.u. 2 R & TV Trsss Ctr, Hu, C. E: q@163.t 3 Dprtt Cputr S, Mr Uvrsty Nwu St. J s, Nwu, C A1B 35. E: w@r.s.u. Astrt

More information

Planar convex hulls (I)

Planar convex hulls (I) Covx Hu Covxty Gv st P o ots 2D, tr ovx u s t sst ovx oyo tt ots ots o P A oyo P s ovx or y, P, t st s try P. Pr ovx us (I) Coutto Gotry [s 3250] Lur To Bowo Co ovx o-ovx 1 2 3 Covx Hu Covx Hu Covx Hu

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

A Gentle Introduction to Matroid Algorithmics

A Gentle Introduction to Matroid Algorithmics A Gntl Introuton to Mtro Alortms Mtts F. Stllmnn Aprl, 06 Mtro xoms T trm mtro ws rst us n 9 y Hsslr Wtny []. ovrvw oms rom t txtooks o Lwlr [] n Wls []. Most o t mtrl n ts A mtro s n y st o xoms wt rspt

More information

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH

MATERIAL SEE BOM ANGLES = 2 > 2000 DATE MEDIUM FINISH NOTS:. LN MTN SUR WT NTUR/SOPROPYL LOOL PROR TO RN L OR LOO. PPLY LOTT 4 ON TRS. TORQU TO. Nm / 00 lb-in 4. TORQU TO 45-50 Nm / - lb-ft 5. TORQU TO Nm / 4.5 lb-ft. TORQU TO 0 Nm / lb-in. TORQU TO 5.5 Nm

More information

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION

DOCUMENT STATUS: MINTP0 E-ST5080, BASE, NO DISPLAY VENDOR: 15.5 INCH MATERIAL SEE BOM FINISH REVISION HISTORY ITEM NO. PART NUMBER DESCRIPTION RV T RVSON STORY SRPTON O Y 0-0-0 PROUTON RLS K. N NOTS:. SRL LL NORMTON: a) VOLTS: V b) MPS:.0 c) YLS: N/ d) WTTS: W e) PS: N/ f) PX #: PX. RTTON LOOS: S / / LN R WT SOPROPYL LOLOL PROR TO PLN.. PK M:

More information

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE N URY T NORTON PROV N RRONOUS NORTON NVRTNTY PROV. SPY S NY TY OR UT T TY RY OS NOT URNT T S TT T NORTON PROV S ORRT, NSR S POSS, VRY ORT S N ON N T S T TY RY. TS NORTON S N OP RO RORS RT SU "" YW No.

More information

Priority Search Trees - Part I

Priority Search Trees - Part I .S. 252 Pro. Rorto Taassa oputatoal otry S., 1992 1993 Ltur 9 at: ar 8, 1993 Sr: a Q ol aro Prorty Sar Trs - Part 1 trouto t last ltur, w loo at trval trs. or trval pot losur prols, ty us lar spa a optal

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4 Mt 166 WIR, Sprin 2012, Bnjmin urisp Mt 166 Wk in Rviw 2 Stions 1.1, 1.2, 1.3, & 1.4 1. S t pproprit rions in Vnn irm tt orrspon to o t ollowin sts. () (B ) B () ( ) B B () (B ) B 1 Mt 166 WIR, Sprin 2012,

More information

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2

SAMPLE CSc 340 EXAM QUESTIONS WITH SOLUTIONS: part 2 AMPLE C EXAM UETION WITH OLUTION: prt. It n sown tt l / wr.7888l. I Φ nots orul or pprotng t vlu o tn t n sown tt t trunton rror o ts pproton s o t or or so onstnts ; tt s Not tt / L Φ L.. Φ.. /. /.. Φ..787.

More information

DOCUMENT STATUS: RELEASE

DOCUMENT STATUS: RELEASE RVSON STORY RV T SRPTON O Y 0-4-0 RLS OR PROUTON 5 MM -04-0 NS TRU PLOT PROUTON -- S O O OR TLS 30 MM 03-3-0 3-044 N 3-45, TS S T TON O PROTTV RM OVR. 3 05--0 LT 3-004, NOT, 3-050 3 0//00 UPT ST ROM SN,

More information

Catalytic S N Ar of Unactivated Aryl Chlorides ESI

Catalytic S N Ar of Unactivated Aryl Chlorides ESI Eltron Supplmntry Mtrl (ESI) or CmComm. Ts journl s T Royl Soty o Cmstry 2014 Ctlyt S Ar o Untvt Aryl Clors ESI Tl o Contnts 1. Prour n Full Tl o Contons - Prour S1 - Intl solvnt srn (no tlyst) - Solvnt

More information

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V,  = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =? xmpl : An 8-gug oppr wr hs nomnl mtr o. mm. Ths wr rrs onstnt urrnt o.67 A to W lmp. Th nsty o r ltrons s 8.5 x 8 ltrons pr u mtr. Fn th mgntu o. th urrnt nsty. th rt vloty xmpl D. mm,.67 A, n N 8.5" 8

More information

17 Basic Graph Properties

17 Basic Graph Properties Ltur 17: Bs Grp Proprts [Sp 10] O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t

More information

A New Interface to Render Graphs Using Rgraphviz

A New Interface to Render Graphs Using Rgraphviz A Nw Intr to Rnr Grps Usn Rrpvz Florn Hn Otor 30, 2017 Contnts 1 Ovrvw 1 2 Introuton 1 3 Dult rnrn prmtrs 3 3.1 Dult no prmtrs....................... 4 3.2 Dult prmtrs....................... 6 3.3 Dult

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN

A RANKING PROCEDURE FOR FUZZY DECISION-MAKING IN PRODUCT DESIGN Ornl rtl rons o IDMME - Vrtl Conpt 2008 jn Cn Otor 8 0 2008 RNKING ROCEDURE FOR FUZZY DECISION-MKING IN RODUCT DESIGN Mro rjs r r 2 ): Déprtmnt Mtémtqs t Gén Instrl Éol olytnq Montrél C.. 6079 S. Cntr-vll

More information

23 Minimum Spanning Trees

23 Minimum Spanning Trees 3 Mnmum Spnnn Trs Eltron rut sns otn n to mk t pns o svrl omponnts ltrlly quvlnt y wrn tm totr. To ntronnt st o n pns, w n us n rrnmnt o n wrs, onntn two pns. O ll su rrnmnts, t on tt uss t lst mount o

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions ulty o Mtmtis Wtrloo, Ontrio N ntr or ution in Mtmtis n omputin r / Mt irls Mr /, 0 rp Tory - Solutions * inits lln qustion. Tr t ollowin wlks on t rp low. or on, stt wtr it is pt? ow o you know? () n

More information

CS 103 BFS Alorithm. Mark Redekopp

CS 103 BFS Alorithm. Mark Redekopp CS 3 BFS Aloritm Mrk Rkopp Brt-First Sr (BFS) HIGHLIGHTED ALGORITHM 3 Pt Plnnin W'v sn BFS in t ontxt o inin t sortst pt trou mz? S?? 4 Pt Plnnin W xplor t 4 niors s on irtion 3 3 3 S 3 3 3 3 3 F I you

More information

Solving Problems with Uncertainty: A case study using Tsuitate-Tsume-Shogi

Solving Problems with Uncertainty: A case study using Tsuitate-Tsume-Shogi olvn Prolms wt nrtnty: A s stuy usn sutt-sum-o Mkoto kut n Hroyuk I Dprtmnt o Computr n, zuok nvrsty {skut, }@s.n.szuok..jp Astrt s ppr xplors t posslty o omputn mprt-normton ms wt ous on ts nm, nmly,

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC Olvr Lrtllot Unvrsty o Jyväskylä Dprtmnt o Mus ABSTRACT In ts ppr, w prsnt n nt mol or sovrn rpt pttrns

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Stronger Virtual Connections in Hex

Stronger Virtual Connections in Hex IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL 7, NO 2, JUNE 2015, PAGES 156-166 156 Stronr Vrtul Conntons n Hx Ju Pwlwz n Ryn Hywr n Plp Hnrson n Bror Arnson Astrt For onnton ms

More information

OpenMx Matrices and Operators

OpenMx Matrices and Operators OpnMx Mtris n Oprtors Sr Mln Mtris: t uilin loks Mny typs? Dnots r lmnt mxmtrix( typ= Zro", nrow=, nol=, nm="" ) mxmtrix( typ= Unit", nrow=, nol=, nm="" ) mxmtrix( typ= Int", nrow=, nol=, nm="" ) mxmtrix(

More information

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33.

DOCUMENT STATUS: CORE HEALTH & FITNESS, LLC IL-D2002-XXAAX IP,DUAL ADJUSTIBLE PULLEY MATERIAL SEE BOM FINISH N/A N/A SHEET SIZE: B SCALE: 1:33. NOTS: RVSON STORY RV T SRPTON O Y //04 RLS OR PROUTON 433 P 34 55 033 OUMNT STTUS: NOT O PROPRTRY NORMTON TS OUMNT SLL NOT RPROU NOR SLL T NORMTON ONTN RN US Y OR SLOS TO OTR XPT S XPRSSLY UTORZ Y OR LT

More information

Distributed Memory Allocation Technique for Synchronous Dataflow Graphs

Distributed Memory Allocation Technique for Synchronous Dataflow Graphs Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar To t ts vrson: Krol Dsnos, Mxm Plt, Jn-Frnços Nzn, Sln Ar. Dstrut Mmory Alloton Tnqu or Synronous Dtlow Grps.

More information

18 Basic Graph Properties

18 Basic Graph Properties O look t t sn y o. Tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on... n tn look t t sn y o. An tn t t twnty-svn 8 y 10 olor lossy pturs wt t rls n rrows n prrp on t k o on

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË

CHELOURANYAN CALENDAR FOR YEAR 3335 YEAR OF SAI RHAVË CHELOURANYAN CALENDAR FOR YEAR YEAR OF SAI RHAVË I tou woust n unon wt our Motr, now tt tou st nvr t Hr. I tou woust sp t v o mttr, now tt tr s no mttr n no v. ~Cry Mry KEY TO CALENDAR T Dys o t W In t

More information

a ( b ) ( a ) a ( c ) ( d )

a ( b ) ( a ) a ( c ) ( d ) Lzy Complton o Prtl Orr to t Smllst Ltt Krll Brtt 1, Ml Morvn 1, Lour Nourn 2 1 LITP/IBP - Unvrst Dns Drot Prs 7 Cs 7014 2, pl Jussu 75256 Prs Cx 05 Frn. ml: (rtt,morvn)@ltp.p.r. 2 Dprtmnt 'Inormtqu Fonmntl

More information

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC

EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC EFFICIENT EXTRACTION OF CLOSED MOTIVIC PATTERNS IN MULTI-DIMENSIONAL SYMBOLIC REPRESENTATIONS OF MUSIC Olvr Lrtllot Unvrsty o Jyväskylä PL 35(A) 4004 Jyväskylä, Fnln lrtllo@mpus.jyu. ABSTRACT An nt mol

More information

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW)

( ) ( ) ( ) 0. Conservation of Energy & Poynting Theorem. From Maxwell s equations we have. M t. From above it can be shown (HW) 8 Conson o n & Ponn To Fo wll s quons w D B σ σ Fo bo n b sown (W) o s W w bo on o s l us n su su ul ow ns [W/ ] [W] su P su B W W 4 444 s W A A s V A A : W W R o n o so n n: [/s W] W W 4 44 9 W : W F

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

Straight-line Grid Drawings of 3-Connected 1-Planar Graphs

Straight-line Grid Drawings of 3-Connected 1-Planar Graphs Strt-ln Gr Drwns o 3-Connt 1-Plnr Grs M. Jwrul Alm 1, Frnz J. Brnnur 2, n Stn G. Koourov 1 1 Drtmnt o Comutr Sn, Unvrsty o Arzon, USA {mlm, koourov}@s.rzon.u 2 Unvrsty o Pssu, 94030 Pssu, Grmny rnn@normtk.un-ssu.

More information

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction F Dtto Roto Lr Alr F Roto C Y I Ursty O solto: tto o l trs s s ys os ot. Dlt to t to ltpl ws. F Roto Aotr ppro: ort y rry s tor o so E.. 56 56 > pot 6556- stol sp A st o s t ps to ollto o pots ts sp. F

More information

Delft University of Technology Parallel and Distributed Systems Report Series. GrenchMark: A Framework for Analyzing, Testing, and Comparing Grids

Delft University of Technology Parallel and Distributed Systems Report Series. GrenchMark: A Framework for Analyzing, Testing, and Comparing Grids Dlt Unvrsty o Tnoloy Prlll n Dstrut Systms Rport Srs GrnMr: A Frmwor or Anlyzn, Tstn, n Comprn Grs A. Iosup n D.H.J. Epm {A.Iosup,D.H.J.Epm}@w.tult.nl rport numr PDS-2005-007 PDS ISSN 1387-2109 Puls n

More information

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm

Sheet Title: Building Renderings M. AS SHOWN Status: A.R.H.P.B. SUBMITTAL August 9, :07 pm 1 2 3 4 5 6 7 8 9 1 11 12 13 14 15 16 17 18 19 orthstar expressly reserves its common law copyright and other property rights for all ideas, provisions and plans represented or indicated by these drawings,

More information

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks. Saeedeh Javanmardi 1, Ahmad Makui 2.

A Multi Objective Graph Based Model for Analyzing Survivability of Vulnerable Networks. Saeedeh Javanmardi 1, Ahmad Makui 2. Journl of Inustrl n Systms Engnrng Vol., No., pp Summr 00 Mult Otv Grp Bs Mol for nlyzng Survvlty of Vulnrl Ntworks S Jvnmr, m Mku Dprtmnt of Inustrl Engnrng, Irn Unvrsty of Sn n Tnology, Trn, Irn mku@ust..r

More information

GrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J.

GrenchMark : a framework for analyzing, testing, and comparing grids Iosup, A.; Epema, D.H.J. GrnMr : rmwor or nlyzn, tstn, n omprn rs Iosup, A.; Epm, D.H.J. Puls n: Prons o t 6t Intrntonl Symposum on Clustr Computn n t Gr (CCGr 26, Snpor, My 16-19, 26) DOI: 1.119/CCGRID.26.49 Puls: 1/1/26 Doumnt

More information

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP

MINI POST SERIES BALUSTRADE SYSTEM INSTALLATION GUIDE PRODUCT CODE: MPS-RP MN POST SRS LUSTR SYSTM NSTLLTON U PROUT O: MPS-RP 0 R0 WLL LN 0 RONT LVTON VW R0 N P 0 T RUR LOK LOT ON LSS. SLON SL TYP. OT SS 000 LSS T 0 00 SRS LSS WT 00/00 (0mm NRMNTS VLL) MX. 000 00-0 (ROMMN) 00

More information

Tangram Fractions Overview: Students will analyze standard and nonstandard

Tangram Fractions Overview: Students will analyze standard and nonstandard ACTIVITY 1 Mtrils: Stunt opis o tnrm mstrs trnsprnis o tnrm mstrs sissors PROCEDURE Skills: Dsriin n nmin polyons Stuyin onrun Comprin rtions Tnrm Frtions Ovrviw: Stunts will nlyz stnr n nonstnr tnrms

More information

Designing A Uniformly Loaded Arch Or Cable

Designing A Uniformly Loaded Arch Or Cable Dsinin A Unirmy Ar Or C T pr wit tis ssn, i n t Nxt uttn r r t t tp ny p. Wn yu r n wit tis ssn, i n t Cntnts uttn r r t t tp ny p t rturn t t ist ssns. Tis is t Mx Eyt Bri in Stuttrt, Grmny, sin y Si

More information

Power-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems

Power-Aware Scheduling under Timing Constraints for Mission-Critical Embedded Systems owr-wr Suln unr Tmn onstrnts or Msson-rtl Em Systms Jnn Lu, H. ou, Nr rz, F Kur Dpt. o Eltrl & omputr Ennrn Unvrsty o lorn Irvn, 92697-262 US jnnl, ou, nr, kur@.u.u Dpt. o Eltrl & omputr Ennrn Unvrsty

More information