s 1 t 4 s 2 4 t 2 a b r 2 r 8 r10 g 4
|
|
- Coleen Norman
- 6 years ago
- Views:
Transcription
1 k-pirs Non-Crossing Shortest Pths in Simple Polgon Evnthi Ppdopoulou Northwestern Universit, Evnston, Illinois 60208, USA Astrt. This pper presents n O(n + k) time lgorithm to ompute the set of k non-rossing shortest pths etween k soure-destintion pirs of points on the oundr of simple polgon of n verties. Pths re llowed to overlp ut re not llowed to ross in the plne. A produt of this result is n O(n) time lgorithm to ompute lned geodesi tringultion whih is es to implement. The lgorithm extends to simple polgon with one hole where soure destintion pirs m pper on oth the inner nd outer oundr of the polgon. In the ltter se, the gol is to ompute olletion of non-rossing pths of minimum totl ost. 1 Introdution The k-pirs non-rossing shortest pth prolem in simple polgon is dened s follows. Given simple polgon P of n verties nd k soure-destintion pirs of points (s i ; t i ); i = 1; : : : ; k, long the oundr of P, nd the olletion of k non-rossing shortest pths onneting ever pir (s i ; t i ) tht lie entirel in P. Non-rossing pths re llowed to overlp i.e., shre verties or edges, ut the re not llowed to ross eh other. Note tht if the soure-destintion pirs re ritrril loted on the polgon oundr there need not e n set of non-rossing pths etween them. In the se where P ontins hole nd the k soure-destintion pirs of points m pper in oth the outer nd the inner oundr of P the prolem is to ompute the olletion of k non-rossing pths whose totl length is minimum. The non-rossing shortest pth prolem ws introdued D.T. Lee in [7]. In [12] Tkhshi et l onsidered the following prolem: Given n undireted plne grph with nonnegtive edge lengths, nd k terminl pirs on two speied fe oundries, nd k non-rossing pths in G, eh onneting terminl pir, whose totl length is minimum. The presented n O(n log n) time lgorithm, where n is the totl numer of verties in the grph (inluding terminl pirs), using divide nd onquer. In susequent pper [11, 10], Tkhshi et l onsider the non rossing shortest pth prolem in polgonl domin of n retngulr ostles nd the L 1 metri nd provide n O((n+k) log(n+k)) time lgorithm. Motivtion for non-rossing shortest pth prolems omes from VLSI lout design (see [7, 10, 12, 11]). In the se of simple polgon or simple polgon with one hole, we n otin n O(k + n log k) time lgorithm using divide nd onquer pproh
2 similr to [12, 11] nd the O(n) time lgorithm of Lee nd Preprt[8] for the single pir shortest pth prolem in simple polgon. Alterntivel, for simple polgon without holes, the prolem n e solved nswering k shortest pth queries using the dt struture of Guis nd Hersherger [4]. The dt struture of [4] n e onstruted in O(n) time nd spe nd n nswer shortest pth queries etween pirs of points in simple polgon in O(log n + l) time where l is the numer of links of the shortest pth. In this pper we present n O(n + k) time lgorithm for the k pirs nonrossing shortest pth prolem in simple polgon nd polgon with one hole. The olletion of non-rossing shortest pths is orgnied in forest tht llows shortest pth queries etween n given pir to e nswered in time proportionl to the sie of the pth. We lso mke n oservtion tht n redue the time omplexit of the lgorithm of Tkhshi et l [11, 10] from O((n + k) log(n + k)) to O(k + n log n). (Note tht k n e lrge ompred to n.) A produt of our lgorithm is simple O(n) method for omputing lned geodesi tringultion of simple polgon. A lned geodesi tringultion is deomposition of simple polgon into tringle-like regions, lled geodesi tringles, with the propert tht n line segment interior to P rosses onl O(log n) geodesi tringles [2, 3]. Suh deomposition nds often pplition in prolems involving simple polgons e.g., r shooting or shortest pth queries [2, 3] nd n e omputed in O(n) time [2]. The ide is to ompute the olletion of shortest pths etween the following pirs of verties (v 1 ; v n=3 ); (v n=3 ; v 2n=3 ); (v 2n=3 ; v 1 ); (v 1 ; v n=6 ); (v n=6 ; v n=3 ); (v n=3 ; v n=2 ), et. until pir onsists of onseutive verties. Our O(n) time lgorithm for omputing the olletion of non-rossing shortest pths mong the ove O(n) pirs of verties gives n lterntive method for omputing lned geodesi tringultion whih is simple to implement. In generl, olletion of non-rossing shortest pths etween pirs of points on the oundr of simple polgon n e used to otin useful polgon deompositions inluding in the deomposition shortest pths etween ertin oundr points. 2 Preliminries Let P e simple polgon nd e its oundr. Given two points x; 2 P, (x; ) denotes the shortest pth from x to tht lies entirel in P. (x; ) is ssumed to e direted from x to. We re given set of k soure-destintion pirs ST = f(s i ; t i ); 1 i kg. We shll dopt the onvention tht soures s i ; 1 i k, re ordered lokwise nd tht for n pir, s i ppers efore t i when we lokwise strting t s 1. Soure s 1 is regrded s the strting point Unless otherwise noted, we ssume lokwise trversl strting t s 1. e mpped onto unit irle. Then the k soure-destintion pirs of points get mpped to k irle hords, s i t i ; i = 1; : : : ; k. Figure 1 shows the mpping. If hord s i t i intersets s j t j then lerl (s i ; t i ) nd (s j ; t j ) must ross eh other. We s tht pirs (s i ; t i ) nd (s j ; t j ) re non-rossing, if nd onl if the orresponding hords in the unit irle s i t i nd s j t j do not interset. For
3 exmple, in gure 1, pirs (s 1 ; t 1 ); (s 2 ; t 2 ); (s 3 ; t 3 ) nd (s 5 ; t 5 ) re non-rossing while pirs (s 4 ; t 4 ) nd (s 5 ; t 5 ) re rossing. It is not diult to see tht shortest pths etween two pirs of points in ST re non-rossing if nd onl if the pirs re themselves non-rossing. s3 s 4 t 2 t 3 s5 t 4 s1 t5 t s 1 3 s 2 s 2 t 1 t 3 s4 t2 s5 t 4 Fig. 1. Mpping of k soure-destintion pirs of verties into k hords on the unit irle. slie t 5 s1 Lemm 1. Given simple polgon P of n verties nd k soure-destintion pirs (s i ; t i ); 1; : : : ; k, deteting if n two shortest pths onneting s i to t i ross eh other n e done in O(n + k) time. Given the unit irle nd pir (s i ; t i ), the region of the unit irle enlosed the hord s i t i nd the r from s i to t i is referred to s slie nd is denoted s sl(s i ; t i ). (A lokwise trversl is ssumed.) For the pir (s 1 ; t 1 ) we dene two slies, sl(s 1 ; t 1 ) nd sl 0 (s 1 ; t 1 ), where sl 0 (s 1 ; t 1 ) is the omplement of sl(s 1 ; t 1 ) i.e., the region of the unit irle enlosed the hord s i t i nd the r from t 1 to s 1. In gure 1, sl(s 1 ; t 1 ) is shown shded. Note tht pths (s i ; t i ) nd (s j ; t j ) re non-rossing if nd onl if the orresponding slies, sl(s i ; t i ) nd sl(s j ; t j ), do not interset or one of them totll ontins the other. In the former se, the two non-rossing pirs re sid to e in series, nd in the ltter, the re sid to e in prllel. The destintion points of pirs tht re in prllel re in reverse order s the soure points. Figure 2 shows n exmple of set of non-rossing slies; slies sl(s 1 ; t 1 ); sl(s 3 ; t 3 ); sl(s 6 ; t 6 ) re in series while sl(s 1 ; t 1 ); sl(s 2 ; t 2 ) re in prllel. Consider now tree, T sl, representing the set of non-rossing slies where the root orresponds to the unit disk nd eh node represents slie. The hildren of the root re sl(s 1 ; t 1 ) nd sl 0 (s 1 ; t 1 ). Slies tht re totll ontined in sl(s i ; t i ) re desendnts of sl(s i ; t i ) in the tree. The immedite hildren of sl(s i ; t i ) (resp. sl 0 (s 1 ; t 1 )) re those slies in series tht re totll ontined in sl(s i ; t i ) (resp. sl 0 (s 1 ; t 1 )) ut re not ontined in n other desendent of sl(s i ; t i ). Figure 2 shows the tree representtion of the orresponding slies. The nodes re leled the slie numer; slie 0 refers to the unit disk. Note tht T sl m e lned or ompletel unlned. Let R e the set of ll points in ST. We ssume tht R is ordered ording to lokwise trversl strting t r 1 = s 1. Given n two points x; we s tht follows x, nd denote s x <, if nd onl if follows x in lokwise trversl of the polgon oundr strting t s 1. Given R 0 R
4 t3 t 5 s 5 t 4 s 6 t6 s s 4 s 3 t 1 t 2 s Fig. 2. Non-rossing slies nd the tree representtion. nd r j 2 R 0, let n R 0(r j ) denote the point in R 0 following r j nd p R 0(r j ) denote the point in R 0 preeding r j. For R 0 = R, n R (r j ) = r j+1 nd p R (r j ) = r j 1. Let R 0 R e suh tht the shortest pths etween n two pirs of distint points re disjoint. The re enlosed the olletion of (r j ; n R 0(r j )) for ever r j 2 R 0 is lled the geodesi polgon indued R 0. In gure 3, the shded re is the geodesi polgon indued R 0 = fr 1 ; r 4 ; r 6 ; r 7 ; r 10 g. The lst ommon vertex long (r j ; n R 0(r j )) nd (r j ; p R 0(r j )) is n pex of the geodesi polgon, nd is denoted s (r j ). If r j is the onl ommon point of (r j ; n R 0(r j )) nd (r j ; p R 0(r j )) then (r j ) = r j. In gure 3, (r 4 ) = nd (r 1 ) = r 1. The ommon prt of (r j ; n R 0(r j )) nd (r j ; p R 0(r j )) (i.e., (r j ; (r j ))) is referred to s the geodesi link of r j. Two onseutive pexes of the geodesi polgon, (r j ) nd (n R 0(r j )), re joined their shortest pth, ((r j ); (r j+1 )), whih is lerl onvex hin with onvexit fing towrds the interior of the geodesi polgon. r10 r 1 r2 r3 r4 r10 r r 2 1 g 1 g 2 r3 r4 r 9 r8 r7 r5 r6 r9 r 8 g 4 g 3 e d r7 r5 r6 Fig. 3. The geodesi polgon indued R 0 = fr 1 ; r 4 ; r 6 ; r 7 ; r 10 g. Fig. 4. The geodesi deomposition of R = fr 1 ; : : : ; r 10 g. If R 0 ontins pirs of distint points whose shortest pths shre some ommon prt, the olletion of (r j ; n R 0(r j )) indues more thn one geodesi polgon in P. In gure 4, set R = fr 1 ; : : : ; r 10 g indues four geodesi polgons g 1 ; g 2 ; g 3 ; g 4, where g 1 = fr 1 ; ; r 5 ; r 6 ; ; r 10 g, g 2 = f; r 2 ; r 3 ; g, g 3 = fd; e; r 9 g, nd g 4 = fe; r 7 ; r 8 g. Two pths (r i ; n R 0(r i )) nd (r j ; n R 0(r j )), j > i + 1, tht re not disjoint shre supth of t lest one vertex whih is referred to s geodesi link. For exmple in gure 4, segment d is ommon to (r 6 ; r 7 ) nd (r 9 ; r 10 ) i.e., d is geodesi link. Note tht geodesi link m onsist of single vertex in whih se the inident geodesi polgons hve ommon pex
5 (e.g., vertex in gure 4). The olletion of geodesi polgons nd links indued (r i ; n R 0(r i )) for ever r i 2 R 0 is lled the geodesi deomposition of P indued R 0 nd is denoted s (R 0 ). In gure 4, the geodesi deomposition of R onsists of four geodesi polgons g 1 ; g 2 ; g 3 ; g 4, The geodesi link joining g 1 nd g 2 is vertex, the geodesi link joining g 1 nd g 3 is (; d) = d nd the geodesi link joining g 3 nd g 4 is vertex e. The geodesi link of r 4 is (r 4 ; ). For ever r j ; j 6= 4, (r j ) = r j, nd (r 4 ) =. Apex (r 1 ) is onsidered to e the root of the geodesi deomposition. This indues unique direted pth from the root to ever geodesi polgon whih denes prent-hild reltion etween the geodesi polgons. The pex of geodesi polgon g inident to its prent is lled the min pex of g nd is denoted s (g). Given geodesi polgon g nd r j 2 R 0 let (r j ; g) e the pex of g tht elongs to ((g); r j ). (If g ontins (r j ) then (r j ; g) = (r j )). In gure 4, (r 4 ; g 1 ) = nd (r 4 ; g 3 ) = d. Given vertex v long onvex hin C nd point p, we s tht v is supporting (with respet to pv) or tht segment pv is supporting to C if the line ontining pv is tngent to C. 3 The Algorithm The olletion of shortest pths etween ever pir of points in ST (given tht ST is non-rossing) forms forest denoted s E. Our lgorithm omputes E in O(n + k) time nd proesses it to nswer shortest pth queries etween n pir in ST in time proportionl to the length of the pth. In prtiulr, n tree of E n e trnsformed into rooted tree ssigning the soure of minimum index s the root. Let n E (s i ; t i ); (s i ; t i ) 2 ST, denote the nerest ommon nestor of s i nd t i in E. (Note tht s i nd t i must elong to the sme tree of E.) Then (s i ; t i ) = (s i ; n E (s i ; t i ) [ (n E (s i ; t i ); t i ). Computing the nerest ommon nestor in E for ever pir (s i ; t i ) 2 ST n e esil done in liner time in ottom-up fshion using T sl s guide. If ll soure-destintion pirs re in series, we n esil ompute the olletion of shortest pths etween them in liner time using n ordinr shortest pth lgorithm for single pir of points[8, 1, 5]. In prtiulr, we n use the Lee-Preprt lgorithm [8] for eh pir independentl. The following lemm ssures tht the time omplexit remins liner. Lemm 2. The olletion of non-rossing shortest pths etween k soure-destintion pirs of points n e found in liner time if the pirs re in series. In generl, we ompute E in ottom-up fshion using the tree of slies, T sl, s guide. In phse 1, we ompute the geodesi deomposition of P indued R. This revels the olletion of (s i ; t i ) for ever pir (s i ; t i ) t lef node of T sl. For n pir (s i ; t i ) t the ottom level of T sl, we olor ll edges long (s i ; t i ) red, nd dd them to E. The remining edges of the geodesi deomposition re ssumed to e white. Let R q, for 1 q h, where h is the height of T sl, denote the set of points ppering t levels 1 to (h q +1) in T sl. Note tht R 1 = R nd
6 R h = fs 1 ; t 1 g. In phse q, 1 < q h, we ompute the geodesi deomposition of P indued R q whih revels the olletion of (s i ; t i ) for ever pir (s i ; t i ) t level (h q + 1) of T sl. Edges of the deomposition t phse q re either red or white. Red edges re those tht hve een dded to E in some previous phse. At the end of phse q, we dd ll white edges long (s i ; t i ) to E nd olor them red, for ever pir (s i ; t i ) t level (h q + 1) of T sl. At ever phse q; 1 q h, the geodesi deomposition of R q is mintined. Geodesi polgons nd links re kept s doul linked list of their verties. In generl, n pex is djent to two verties in its geodesi polgon nd one vertex in the inident geodesi link. An exeption re pexes tht re ommon to two geodesi polgons (e.g. pex in gure 4), whih re inident to two verties in eh of the inident geodesi polgons. Edges of geodesi polgons nd geodesi links re mrked s red or white, where ll red edges hve een inluded in E. In order to hve the ilit to extrt the white edges of (s i ; t i ) for some pir (s i ; t i ) t level (h q+1) of T sl without visiting the red edges long (s i ; t i ), we lso mintin doul linked list of the polgon verties inident to white edges, referred to s the white-list. The white-list inludes (r j ) for ever r j 2 R q. Two verties v; u in the white-list re joined link if nd onl if v nd u elong to the shortest pth from (r j ) to (n R q (r j )) nd either vu is white edge or (v; u) is mximl red supth of ((r j ); (n R q (r j ))). Ever link of the white-list orresponds either to white edge of the deomposition, referred to s white link, or to mximl sequene of red edges, referred to s red link. Note tht white edge long geodesi link ppers twie in the white-list nd thus eh of the inident verties lso ppers twie. Let's onsider the geodesi deomposition of phse 1, i.e., the geodesi deomposition of R. Pirs (r i ; r i+1 ); 1 i 2k, re lerl in series nd therefore the olletion of (r i ; r i+1 ) n e omputed in O(n + k) time (lemm 2). One (r i ; r i+1 ) for ever i; 1 i 2k, hve een omputed, the geodesi deomposition of P n e esil otined in liner time. For ever pir of points (s i ; t i ) t the ottom level of T sl, we olor edges long (s i ; t i ) red nd dd them to E. We lso uild the white list simple sn strting t (r 1 ). To ompute the geodesi deomposition of R q ; q > 1, we use the geodesi deomposition of R q 1. To filitte updting we use the shortest pth tree from s 1 to ll points in R. Computing the shortest pth tree from s 1 n e done in liner time using the lgorithm of Guis et l [5] or the simpler to implement lgorithm of Hersherger nd Snoeink [6]. Given two points r i ; r j 2 R, the nerest ommon nestor of r i nd r j in the shortest pth tree from s 1 is denoted s n(r i ; r j ). Suppose tht the geodesi deomposition of P indued R q 1 hs een omputed, nd tht we wnt to ompute the geodesi deomposition indued R q. Let R 0q = R q 1 R q. For revit, we will use n(r j ) to denote n R q(r j ), p(r j ) to denote p R q(r j ), nd to denote the geodesi deomposition during phse q. At the end of phse q, = (R q ). Consider r j 2 R q suh tht n(r j ) 6= n R q 1(r j ). Sine r j nd n(r j ) re neighoring points in R q, we need to ompute ((r j ); (n(r j ))) nd updte the geodesi deomposition. For this purpose we inrementll ompute ((r j ); (r i ))
7 for ever r i 2 R 0q [ fn(r j )g with r j < r i n(r j ), updting t the sme time the geodesi deomposition. Suppose tht ((r j ); (r i )) hs een omputed for some r i 2 R 0q ; r j < r i < n(r j ), nd tht the geodesi deomposition hs een updted ordingl. i.e., = (R q [ fr 2 R q 1 ; r r i g). It is enough to updte the geodesi polgon g tht ontins (r i ) ording to ((r j ; g); (r l ; g)). (g) l j i (g) 5 4 j i l Fig. 5. ((g); j ; i ; l ) Fig. 6. The updte of g in se 3. Let j ; i nd l denote (r j ; g); (r i ) nd (r l ; g) respetivel. Note tht j or l m oinide with the min pex of g. Consider the geodesi deomposition indued f(g); j ; i ; l g, denoted s ((g); j ; i ; l ). If (g) = j or (g) = l, ((g); j ; i ; l ) must form geodesi tringle (i.e., hve three pexes). Otherwise, ((g); j ; i ; l ) forms either geodesi qudrilterl (four pexes, gure 5) or two geodesi tringles (gure 7). In n se, let g( i ) denote the geodesi polgon of ((g); j ; i ; l ) ontining i. Let ; nd denote the pexes of ((g); j ; i ; l ), other thn i, suh tht is the lst ommon vertex long ((g); j ) nd ((g); l ), is the lst ommon vertex long ( j ; (g)) nd ( j ; i ), nd is the lst ommon vertex long ( l ; i ) nd ( l ; (g)). If (g) = j (resp. (g) = i ) then = (g) = (resp. = (g) = ). If g( i ) is geodesi tringle (see gure 7), let 0 denote the min pex of g( i ). Note tht 0 = n( j ; i ) or 0 = n( i ; l ). Furthermore, if g( i ) is geodesi qudrilterl then = n(r j ; r l ). To updte g, we need to ompute ( j ; l ) i.e., it is enough to ompute (; ). If g( i ) is geodesi qudrilterl (see gure 5) we sill need to ompute segment where 2 ( i ; ) [ (; ) nd 2 ( i ; ) [ (; ) suh tht nd re supporting nd lies entirel in P (see gure 8). Then (; ) = (; ) [ [ (; ), where (; ) nd (; ) re oth known. There re four possile ses for segment (see gure 8). Cse 1: 2 ( i ; ) nd 2 ( i ; ) (gure 8()). Cse 2: 2 (; ) nd 2 ( i ; ), 6= (gure 8()). Cse 3: 2 ( i ; ) nd 2 (; ), 6= (gure 8()). Cse 4: 2 (; ) nd 2 (; ), 6=, 6= (gure 8(d)). If g( i ) is geodesi tringle then ( j ; l ) is lred known. (Rell tht ((g); j ) nd ((g); l ) elong to the shortest pth tree from s 1 ). If 0 = n( j ; i ), let = 0 nd let e the vertex following long ( 0 ; ). Segment is supporting to oth ( 0 ; ) nd ( 0 ; i ). Sine 2 (; ) nd 2 ( i ; ), this n e regrded s se (2) for 6= or se (1) for =. If 0 = n( l ; i ), let = 0 nd e the following vertex long ( 0 ; ). Sine 2 (; i ) nd 2 (; ) this n e regrded s se (3) for 6= or se (1) for =.
8 (g) (g) j j l i l i Fig. 7. g( i ) is geodesi tringle. (g) l j i (g) j i l (g) l j i (g) j l i () () () (d) Fig. 8. The four ses for segment. To determine whih of the four ses is the one ourring nd determine verties nd, we dvne vrile vertex v long ( i ; ) [ (; ) nd vrile vertex u long ( i ; ) [ (; ) until v = nd u = (v nd u strt t i ). The prolem is tht verties ; nd s well s pexes j nd l nd (g) re not known in dvne. However, useful informtion n e otined while dvning v nd u using the shortest pth tree from s 1. In prtiulr, we n determine tht v = (resp. u = ) due to the following propert: v =, for v 2 ( i ; j ), (resp. u =, u 2 ( i ; l )) if nd onl if the predeessor of v (resp. u) on the shortest pth from s 1, denoted s pred(v), is supporting with respet to pred(v)v (resp. pred(u)u) nd pred(v) 62 ( i ; j ) (resp. pred(u) 62 ( i ; l )). Vertex needs to e known onl in se 4 in whih se = n(r j ; r l ). Segment vu is dvned so tht it lws lies entirel in the interior of g( i ). This n e esil enfored due to the following propert: vu intersets (; ) (resp. (; )) if nd onl if pred(u) (resp. pred(v)) lie t the sme side of vu s i. If t n point during the dvnement it is determined tht vu intersets (; ) (resp. (; )), we hve se 3 or se 4 (resp. se 2 or 4). After segment hs een determined the updte of g n e rie stted s follows: Cse 1: Remove (; i ) [ ( i ; ) nd dd =. Cse 2: Remove (; i ) [ ( i ; ) nd dd = (; ) [. Cse 3: Remove (; i )( i ; ) nd dd = (; ) [. Cse 4: Remove (; i )( i ; ) nd dd = (; ) [ [ (; ). To updte g in n of the four ses we wlk long the orresponding (; ) strting t verties or. (In se 4 we wlk long 1 = (; ) nd 2 = (; ) nd then onsider segment.) Figure 6 illustrtes the updte of g for se 3 i.e., = (; ). Note tht edge 2 3 nd vertex 4 eome geodesi links.
9 The edges visited the lgorithms to determine nd updte g re either deleted from g or the lie long (; ). For eh edge visited onl onstnt time is spent. Edges long re either new white edges to e dded to the geodesi deomposition or the eome prt of geodesi link. One n edge joins geodesi link t some phse, it is never visited gin until it gets output or deleted from the geodesi deomposition. Thus over ll phses, the time spent for updtes of the geodesi deomposition is proportionl to the totl numer of edges ppering in the geodesi deomposition throughout the lgorithm. Sine no two suh edges interset nd sine the re lws inident to verties or points in R, their numer is ounded O(n + k). To updte the white list, let 0 e the pth otined from sustituting n mximl sequene of red edges single red link. Let h 1 nd h 2 e the verties in the white-list preeding nd following (or oiniding) the endpoints of respetivel. (All verties in the white-list etween h 1 nd h 2 got deleted from during the updte.) Delete the prt of the white list etween h 1 nd h 2 nd merge 0. The time spent is proportionl to the numer verties deleted plus the sie of. Thus, Lemm 3. The totl time spent for updting the geodesi deomposition nd the white-list in ever phse of the lgorithm is O(n + k). To omplete the updte, we need to ompute n(r j ; r l ) sine r j nd r l eome neighors fter the deletion of r i. Clerl n(r j ; r l ) is the one etween n(r j ; r i ) nd n(r i ; r l ) tht ours rst long (s 1 ; r i ) i.e., the one nerest to the root. Assigning level numer to ll nodes of the shortest pth tree from s 1 llows to ompute n(r j ; r l ) from n(r j ; r i ) nd n(r i ; r l ) in onstnt time. After the geodesi deomposition indued R q hs een omputed, we need to extrt white edges of (s i ; t i ) for ever pir (s i ; t i ) t level (h q + 1) of T sl, dd them to E, olor them red, nd updte the white list. Strting t (s i ) we follow the white list until (t i ), dding the enountered white edges to E. Note tht white edges long (s i ; t i ) tht re prt of geodesi links pper twie long the white-list nd tht oth ourrenes must eome red. Finll, sustitute ((s i ); (t i )) single red link etween (s i ) nd (t i ). The time spent is proportionl to the numer of white edges tht get output to E i.e., eome red. We therefore onlude tht E n e omputed in O(n + k) time. 4 Conluding Remrks We hve given simple liner time lgorithm for the k-pirs non-rossing shortest pth prolem in simple polgon P. Similrl, to [12, 11, 10], this result n e extended to simple polgon P with one hole Q where soure-destintion pirs m pper on The min oservtion is tht one pth i etween s i nd t i hs een routed there is onl one w (if n) to route the rest of the pirs. Furthermore, i n e routed in onl two ws: lokwise nd ounterlokwise round Q. If P is set of retngles enlosed n outer retngle nd points in ST pper on the outer retngle nd one inner retngle the shortest non-rossing
10 pth prolem n e solved in O((n + k) log(n + k)) time s shown in [11, 10] where n is the numer or retngles nd k is the numer of pirs. Note however tht k n e ritrril lrge ompred to n. Our oservtion is tht k need not pl role in the min prt of the lgorithm. The ide is s follows: Given ST nd the set of retngles, derive set ST 0 of O(minfn; kg) pirs, solve the prolem for ST 0 using the lgorithm of [11] in O(n log n) time, nd modif the solution in dditionl O(k) time to derive the set of non-rossing pths for ST. In prtiulr, onsider the prtition of the outer retngle into intervls derived the vertil nd horiontl vlid projetions of the inner retngles. (Vlid projetion lines do not interset ostles.) For (s i ; t i ) 2 ST, let I si nd I ti denote the intervls on the outer retngle ontining s i nd t i respetivel. Let ; nd ; d e the endpoints of I si nd I ti. Then ST 0 = f(i si ; I ti ); (s i ; t i ) 2 ST g, where (I si ; I ti ) = f(; ); (; d); (; ); (; d)g. Computing (s i ; t i ) for (s i ; t i ) 2 ST in [11] n now e sustituted omputing (; ); (; d); (; ), nd (; d). The detils re left for the full pper. Aknowledgment. I would like to thnk professor D.T. Lee for mn helpful disussions nd omments. Referenes 1. B. Chelle, \A theorem on polgon utting with pplitions," Pro. 23rd Annu. IEEE Smpos. Found. Comput. Si., 1982, pp. 339{ B. Chelle, H. Eddelsrunner, M. Grigni, L. Guis, J. Hersherger, M. Shrir, nd J. Snoeink, \R shooting in polgons using geodesi tringultions", Algorithmi, 12, 1994, M. T. Goodrih nd R. Tmssi, \Dnmi R Shooting nd Shortest Pths vi Blned Geodesi Tringultions", In Pro. 9th Annu. ACM Smpos. Comput. Geom, 1993, L.J. Guis nd J. Hersherger, \Optiml shortest pth queries in simple polgon", J. Comput. Sst. Si., 39, 1989, L.J. Guis, J. Hersherger, D. Leven, M. Shrir, nd R.E. Trjn, \Liner-time lgorithms for visiilit nd shortest pth prolems inside tringulted simple polgons". Algorithmi, 2, , J. Hersherger nd J. Snoeink, \Computing Minimum Length Pths of given homotop lss", Comput. Geometr: Theor nd Applitions, 4, 1994, D.T. Lee, \Non-rossing pths prolems", Mnusript, Dept. of EECS, Northwestern Universit, D. T. Lee nd F. P. Preprt, \Euliden Shortest Pths in the Presene of Retiliner Brriers", Networks, , F.P. Preprt nd M. I. Shmos, Computtionl Geometr: n Introdution, Springer-Verlg, New York, NY J. Tkhshi, H. Suuki, nd T. Nishieki, \Finding shortest non-rossing retiliner pths in plne regions", Pro. of ISAAC'93, Let. Notes in Computer Siene, Spinger-Verlg, 762, 1993, J. Tkhshi, H. Suuki, nd T. Nishieki, \Shortest non-rossing retiliner pths in plne regions", Algorithmi, to pper. 12. J. Tkhshi, H. Suuki, nd T. Nishieki, \Shortest non-rossing pths in plne grphs", Algorithmi, to pper.
11 This rtile ws proessed using the LA T EX mro pkge with LLNCS stle
Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms
Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
More informationCOMP108 Algorithmic Foundations
Grph Theory Prudene Wong http://www.s.liv..uk/~pwong/tehing/omp108/201617 How to Mesure 4L? 3L 5L 3L ontiner & 5L ontiner (without mrk) infinite supply of wter You n pour wter from one ontiner to nother
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationConvex Hull Algorithms. Convex hull: basic facts
CG Leture D Conve Hull Algorithms Bsi fts Algorithms: Nïve, Gift wrpping, Grhm sn, Quik hull, Divide-nd-onquer Lower ound 3D Bsi fts Algorithms: Gift wrpping, Divide nd onquer, inrementl Conve hulls in
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationWidth and Bounding Box of Imprecise Points
Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,
More information12/9/14. CS151 Fall 20124Lecture (almost there) 12/6. Graphs. Seven Bridges of Königsberg. Leonard Euler
CS5 Fll 04Leture (lmost there) /6 Seven Bridges of Königserg Grphs Prof. Tny Berger-Wolf Leonrd Euler 707-783 Is it possile to wlk with route tht rosses eh ridge e Seven Bridges of Königserg Forget unimportnt
More informationFinal Exam Review F 06 M 236 Be sure to look over all of your tests, as well as over the activities you did in the activity book
inl xm Review 06 M 236 e sure to loo over ll of your tests, s well s over the tivities you did in the tivity oo 1 1. ind the mesures of the numered ngles nd justify your wor. Line j is prllel to line.
More informationLesson 4.4. Euler Circuits and Paths. Explore This
Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Adm Sheffer. Office hour: Tuesdys 4pm. dmsh@cltech.edu TA: Victor Kstkin. Office hour: Tuesdys 7pm. 1:00 Mondy, Wednesdy, nd Fridy. http://www.mth.cltech.edu/~2014-15/2term/m006/
More informationLecture 13: Graphs I: Breadth First Search
Leture 13 Grphs I: BFS 6.006 Fll 2011 Leture 13: Grphs I: Bredth First Serh Leture Overview Applitions of Grph Serh Grph Representtions Bredth-First Serh Rell: Grph G = (V, E) V = set of verties (ritrry
More informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationCS 551 Computer Graphics. Hidden Surface Elimination. Z-Buffering. Basic idea: Hidden Surface Removal
CS 55 Computer Grphis Hidden Surfe Removl Hidden Surfe Elimintion Ojet preision lgorithms: determine whih ojets re in front of others Uses the Pinter s lgorithm drw visile surfes from k (frthest) to front
More informationAdjacency. Adjacency Two vertices u and v are adjacent if there is an edge connecting them. This is sometimes written as u v.
Terminology Adjeny Adjeny Two verties u nd v re djent if there is n edge onneting them. This is sometimes written s u v. v v is djent to nd ut not to. 2 / 27 Neighourhood Neighourhood The open neighourhood
More informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Instructor: Adm Sheffer. TA: Cosmin Pohot. 1pm Mondys, Wednesdys, nd Fridys. http://mth.cltech.edu/~2015-16/2term/m006/ Min ook: Introduction to Grph
More informationGreedy Algorithm. Algorithm Fall Semester
Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion
More informationLecture 8: Graph-theoretic problems (again)
COMP36111: Advned Algorithms I Leture 8: Grph-theoreti prolems (gin) In Prtt-Hrtmnn Room KB2.38: emil: iprtt@s.mn..uk 2017 18 Reding for this leture: Sipser: Chpter 7. A grph is pir G = (V, E), where V
More informationMITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam
Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...
More informationProblem Final Exam Set 2 Solutions
CSE 5 5 Algoritms nd nd Progrms Prolem Finl Exm Set Solutions Jontn Turner Exm - //05 0/8/0. (5 points) Suppose you re implementing grp lgoritm tt uses ep s one of its primry dt strutures. Te lgoritm does
More informationCalculus Differentiation
//007 Clulus Differentition Jeffrey Seguritn person in rowot miles from the nerest point on strit shoreline wishes to reh house 6 miles frther down the shore. The person n row t rte of mi/hr nd wlk t rte
More informationInternet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.
omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to
More informationDuality in linear interval equations
Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny
More informationChapter 4 Fuzzy Graph and Relation
Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml
More information8.2 Areas in the Plane
39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to
More informationTight triangulations: a link between combinatorics and topology
Tight tringultions: link between ombintoris nd topology Jonthn Spreer Melbourne, August 15, 2016 Topologil mnifolds (Geometri) Topology is study of mnifolds (surfes) up to ontinuous deformtion Complited
More informationLine The set of points extending in two directions without end uniquely determined by two points. The set of points on a line between two points
Lines Line Line segment Perpendiulr Lines Prllel Lines Opposite Angles The set of points extending in two diretions without end uniquely determined by two points. The set of points on line between two
More informationComputational geometry
Leture 23 Computtionl geometry Supplementl reding in CLRS: Chpter 33 exept 33.3 There re mny importnt prolems in whih the reltionships we wish to nlyze hve geometri struture. For exmple, omputtionl geometry
More informationMinimal Memory Abstractions
Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures
More informationJournal of Combinatorial Theory, Series A
Journl of Comintoril Theory, Series A 0 (0) Contents lists ville t SiVerse SieneDiret Journl of Comintoril Theory, Series A www.elsevier.om/lote/jt Spheril tiling y ongruent pentgons Hongho Go, Nn Shi,
More informationV = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)
Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from
More informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationCS553 Lecture Introduction to Data-flow Analysis 1
! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow
More informationOutline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP
ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More informationSuffix trees, suffix arrays, BWT
ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time
More informationOutline. Introduction Suffix Trees (ST) Building STs in linear time: Ukkonen s algorithm Applications of ST
Suffi Trees Outline Introduction Suffi Trees (ST) Building STs in liner time: Ukkonen s lgorithm Applictions of ST 2 3 Introduction Sustrings String is ny sequence of chrcters. Sustring of string S is
More informationDistance vector protocol
istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers
More informationa c = A C AD DB = BD
1.) SIMILR TRINGLES.) Some possile proportions: Geometry Review- M.. Sntilli = = = = =.) For right tringle ut y its ltitude = = =.) Or for ll possiilities, split into 3 similr tringles: ll orresponding
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationGeometric Algorithms. Geometric Algorithms. Warning: Intuition May Mislead. Geometric Primitives
Geometri Algorithms Geometri Algorithms Convex hull Geometri primitives Closest pir of points Voronoi Applitions. Dt mining. VLSI design. Computer vision. Mthemtil models. Astronomil simultion. Geogrphi
More informationGeometrical reasoning 1
MODULE 5 Geometril resoning 1 OBJECTIVES This module is for study y n individul teher or group of tehers. It: looks t pprohes to developing pupils visulistion nd geometril resoning skills; onsiders progression
More informationThe Greedy Method. The Greedy Method
Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm
More information3D convex hulls. Convex Hull in 3D. convex polyhedron. convex polyhedron. The problem: Given a set P of points in 3D, compute their convex hull
Convex Hull in The rolem: Given set P of oints in, omute their onvex hull onvex hulls Comuttionl Geometry [si 3250] Lur Tom Bowoin College onvex olyheron 1 2 3 olygon olyheron onvex olyheron 4 5 6 Polyheron
More informationHonors Thesis: Investigating the Algebraic Properties of Cayley Digraphs
Honors Thesis: Investigting the Algebri Properties of Cyley Digrphs Alexis Byers, Wittenberg University Mthemtis Deprtment April 30, 2014 This pper utilizes Grph Theory to gin insight into the lgebri struture
More informationCompact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends
Compt Drwings of 1-Plnr Grphs with Right-Angle Crossings nd Few Bends Steven Chplik, Fbin Lipp, Alexnder Wolff, nd Johnnes Zink Lehrstuhl für Informtik I, Universität Würzburg, Germny http://www1.informtik.uni-wuerzburg.de/en/stff
More informationCMPUT101 Introduction to Computing - Summer 2002
CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,
More informationThe Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline
CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The
More informationINTEGRATED WORKFLOW ART DIRECTOR
ART DIRECTOR Progrm Resoures INTEGRATED WORKFLOW PROGRAM PLANNING PHASE In this workflow phse proess, you ollorte with the Progrm Mnger, the Projet Mnger, nd the Art Speilist/ Imge Led to updte the resoures
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationSingle-Layer Trunk Routing Using 45-Degree Lines within Critical Areas for PCB Routing
SASIMI 2010 Proeedings (R3-8) Single-Lyer Trunk Routing Using 45-Degree Lines within Critil Ares for PCB Routing Kyosuke SHINODA Yukihide KOHIRA Atsushi TAKAHASHI Tokyo Institute of Tehnology Dept. of
More informationInformation Retrieval and Organisation
Informtion Retrievl nd Orgnistion Suffix Trees dpted from http://www.mth.tu.c.il/~himk/seminr02/suffixtrees.ppt Dell Zhng Birkeck, University of London Trie A tree representing set of strings { } eef d
More informationOutline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals
Outline CS38 Introution to Algorithms Leture 2 April 3, 2014 grph trversls (BFS, DFS) onnetivity topologil sort strongly onnete omponents heps n hepsort greey lgorithms April 3, 2014 CS38 Leture 2 2 Grphs
More informationGraphs with at most two trees in a forest building process
Grphs with t most two trees in forest uilding process rxiv:802.0533v [mth.co] 4 Fe 208 Steve Butler Mis Hmnk Mrie Hrdt Astrct Given grph, we cn form spnning forest y first sorting the edges in some order,
More informationTiling Triangular Meshes
Tiling Tringulr Meshes Ming-Yee Iu EPFL I&C 1 Introdution Astrt When modelling lrge grphis senes, rtists re not epeted to model minute nd repetitive fetures suh s grss or snd with individul piees of geometry
More informationCS453 INTRODUCTION TO DATAFLOW ANALYSIS
CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
More informationResearch Article Determining Sensor Locations in Wireless Sensor Networks
Interntionl Journl of Distriuted Sensor Networks Volume 2015, Artile ID 914625, 6 pges http://dx.doi.org/10.1155/2015/914625 Reserh Artile Determining Sensor Lotions in Wireless Sensor Networks Zimo Li
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationQuadrilateral and Tetrahedral Mesh Stripification Using 2-Factor Partitioning of the Dual Graph
The Visul omputer mnusript No. (will e inserted y the editor) Plo Diz-Gutierrez M. Gopi Qudrilterl nd Tetrhedrl Mesh Stripifition Using 2-Ftor Prtitioning of the Dul Grph strt In order to find 2-ftor of
More informationMidterm Exam CSC October 2001
Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not
More informationIntermediate Information Structures
CPSC 335 Intermedite Informtion Structures LECTURE 13 Suffix Trees Jon Rokne Computer Science University of Clgry Cnd Modified from CMSC 423 - Todd Trengen UMD upd Preprocessing Strings We will look t
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationParallelization Optimization of System-Level Specification
Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion
More informationPosition Heaps: A Simple and Dynamic Text Indexing Data Structure
Position Heps: A Simple nd Dynmic Text Indexing Dt Structure Andrzej Ehrenfeucht, Ross M. McConnell, Niss Osheim, Sung-Whn Woo Dept. of Computer Science, 40 UCB, University of Colordo t Boulder, Boulder,
More informationGraph theory Route problems
Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re
More informationDistributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems
Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted
More informationDistributed Systems Principles and Paradigms
Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,
More informationAugmenting Sux Trees, with Applications Yossi Matias 1?, S. Muthukrishnan 2??,Suleyman Cenk Ṣahinalp 3???, and Jacob Ziv 4 y 1 Tel-Aviv University, an
Augmenting Sux Trees, with Applitions Yossi Mtis 1?, S. Mhukrishnn??,Suleymn Cenk Ṣhinlp 3???, nd Jo Ziv 4 y 1 Tel-Aviv University, nd Bell Ls, Murry Hill Bell Ls, Murry Hill 3 University ofwrwik nd University
More informationCan Pythagoras Swim?
Overview Ativity ID: 8939 Mth Conepts Mterils Students will investigte reltionships etween sides of right tringles to understnd the Pythgoren theorem nd then use it to solve prolems. Students will simplify
More informationTracking Hidden Agents Through Shadow Information Spaces
Trking Hidden Agents Through Shdow Informtion Spes Jingjin Yu Steven M. LVlle jyu@uiu.edu lvlle@uiu.edu Deprtment of Computer Siene University of Illinois Urn, IL 601 USA Astrt This pper ddresses prolems
More informationMcAfee Web Gateway
Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationCOSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview
COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition
More information4.3 Balanced Trees. let us assume that we can manipulate them conveniently and see how they can be put together to form trees.
428 T FOU 4.3 Blned Trees T BT GOIT IN T VIOU setion work well for wide vriety of pplitions, ut they hve poor worst-se performne. s we hve noted, files lredy in order, files in reverse order, files with
More informationA METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES
A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:
More information6.045J/18.400J: Automata, Computability and Complexity. Quiz 2: Solutions. Please write your name in the upper corner of each page.
6045J/18400J: Automt, Computbility nd Complexity Mrh 30, 2005 Quiz 2: Solutions Prof Nny Lynh Vinod Vikuntnthn Plese write your nme in the upper orner of eh pge Problem Sore 1 2 3 4 5 6 Totl Q2-1 Problem
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationDoubts about how to use azimuth values from a Coordinate Object. Juan Antonio Breña Moral
Douts out how to use zimuth vlues from Coordinte Ojet Jun Antonio Breñ Morl # Definition An Azimuth is the ngle from referene vetor in referene plne to seond vetor in the sme plne, pointing towrd, (ut
More informationPLANE 3-TREES: EMBEDDABILITY & APPROXIMATION
PLANE 3-TREES: EMBEDDABILITY & APPROXIMATION STEPHANE DUROCHER AND DEBAJYOTI MONDAL Astrt. We give n O(nlog 3 n)-time liner-spe lgorithm tht, given plne 3-tree G ith n verties nd set S of n points in the
More informationSuffix Tries. Slides adapted from the course by Ben Langmead
Suffix Tries Slides dpted from the course y Ben Lngmed en.lngmed@gmil.com Indexing with suffixes Until now, our indexes hve een sed on extrcting sustrings from T A very different pproch is to extrct suffixes
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
More informationcalled the vertex. The line through the focus perpendicular to the directrix is called the axis of the parabola.
Review of conic sections Conic sections re grphs of the form REVIEW OF CONIC SECTIONS prols ellipses hperols P(, ) F(, p) O p =_p REVIEW OF CONIC SECTIONS In this section we give geometric definitions
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationString comparison by transposition networks
String omprison y trnsposition networks Alexnder Tiskin (Joint work with Peter Krushe) Deprtment of Computer Siene University of Wrwik http://www.ds.wrwik..uk/~tiskin (inludes n extended version of this
More informationSOFTWARE-BUG LOCALIZATION WITH GRAPH MINING
Chpter 17 SOFTWARE-BUG LOCALIZATION WITH GRAPH MINING Frnk Eihinger Institute for Progrm Strutures nd Dt Orgniztion (IPD) Universit-t Krlsruhe (TH), Germny eihinger@ipd.uk.de Klemens B-ohm Institute for
More informationand vertically shrinked by
1. A first exmple 1.1. From infinite trnsltion surfe mp to end-periodi mp. We begin with n infinite hlf-trnsltion surfe M 0 desribed s in Figure 1 nd n ffine mp f 0 defined s follows: the surfe is horizontlly
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationFASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,
More informationPROBLEM OF APOLLONIUS
PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles
More informationGraph Searching & Perfect Graphs
Grph Serhing & Perfet Grphs Lll Moutdid University of Toronto Astrt Perfet grphs, y definition, hve nie struture, tht grph serhing seems to extrt in, often non-inexpensive, mnner. We srth the surfe of
More informationProduct of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials
Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,
More informationFrom Indexing Data Structures to de Bruijn Graphs
From Indexing Dt Structures to de Bruijn Grphs Bstien Czux, Thierry Lecroq, Eric Rivls LIRMM & IBC, Montpellier - LITIS Rouen June 1, 201 Czux, Lecroq, Rivls (LIRMM) Generlized Suffix Tree & DBG June 1,
More informationContainers: Queue and List
Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of
More information5 ANGLES AND POLYGONS
5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.
More information