© @ chaser ‘Advanced Data structs Peter Bas, Cambvidge Unhersty Pres, 2008 {ie Sutures for Set of tena 2 tne Hees. Segment ees 4. tes for sums of Weighted tent Stes er tenes Mairum Sum Queer 6-ontogonal ange Hees 1. Higher Dimensional Segment res 8. Other Syston af Sul los 9 RangeCoumting and the Semigoup Model 10KaTees ad reat detled noes plese Here ave deta nots onthe opis rom Advance aa Stace by Pete ras, fous on ena ‘Wes Segment wees and ested sructwes 1. Tree Structures for Sets of Intervals + tena ate andeentl in computational earetry and vous applications nding ‘scheduling, databases and geoph intormation sss, 1+ cen data svucues are needed to store ad query ses finer 1 ees designed forinenals aia operations ie searching fer reaping inter uron ot interasand range ques 4 2. Interval Toes. ‘+ efron A dats seucre that afows ecient quarying of inten that verap a givn pin or “+ Abulanced bina seach ue (BS) where each node present ante ‘+ Thee stypcaly sorted by te staing pons oer. ‘+ tach nade stores the maim endpoint fs ube to facta fast queries. + Operations: 1 Insertion ser an inter ile maining the BT prope “Deletion: emove anintrl ad ebalan!” neces “Querying Find ntl that ove ith given pint ental + Time Compe: “+ nerton/Deetion O(log n) + Querying: O(log n+), whew ks the numberof eparted mera 3. Segment Trees ‘+ Acomplete binary tee where each node resents an interah 1+ Theleat nes conespond to meta onal a internal nodes erent the elon of ld nents + Operations ‘bit construct the wee in On log).1+ Range Queries: fen compute the sum min. max cr sunt fale within a speci ‘ange + Updates: ost anlementin O(log). + Advantages: “+ ser guns compared simple ay ‘+ Suppons dmamic updates. ‘4. Trees for the Union of Intervals ese wth computing the vsion ofmulpeoveraping nena, Uses interval wees of augmented segment wees 0 maintain sets fntenk, 1 Appa 1 compan he tots length of covered nein 4 5. Trees for Sums of Weighted Intervals ‘cerson of segment tres where ich neal hasan ached weight, eestor “+ Aggregtng weighted value within an itera 1 Feick Hee nay inden Tae filer for pass ‘+ Segment Tee with ary Propagation Useful for ange updates. 4 6. Trees for Interval-Restricted Maximuin Sum Queries “here ees ficient hand queries fr masimum sum mbar within a specie ‘en bulk ing sagmant trees wth atonal data to mata pei and suum -ppltions: 1 Financ data nasi ang maximum prof windows). 1+ Maximum subsry problems. 7. Orthogonal Range Trees Defnon: A muticimersional steno final use uted orange sehing. severe LY ‘tach nde representa ange along one dimension 1 Secondary wes rested wees] manage the second dimension ‘operations “Point Queries Deeine whether given point exists ina et 1+ Range Queries: Coun eter points win agen rectangle Time Complain: Biking: O(n lon) 4 aueryng: O(log) fr d-tiensions data, -plcaons 1 spat databases +1+ osograpne inromanon yen ‘+ Newest rego torch £8. Higher-Dimensional Segment Trees + txande segment ees to handle mutiple meron. 1 Aceoment tie for each dimension, ‘+ A2D segment we corso primary segment tee where each node stores nother segrent ie > + operations: 1+ Range Sum Ques: ir sum or max ove 2 20/30 egon + Update eres Mody an elementin O(log!) + Aplications “+ Mutismensions! ange ques in databases 1+ computational pyc sation: 9. Other Systems of Building Blocks + vous yb and ahanced We rues a+ wed fo spec opps. + amples include “Intra skp Lins Combines inte tees ith spline for tii ening. 1 Perssten Data tutes: Used forhisorel ques “+ Augmented Red lack Wee: eck res ith ition dat fr ange quis. 410. Range-Counting and the Semigroup Model + Range Counting Counting th numberof elements ina gen ange, + Somigroup Mode 1+ Used hen cement long ta senior soir but nt neces erie penton, + Enables tcl aggregate ques ke sum mie. max. 1 Fenwick Rees (8s fein fr pei sum ques “+ Wavelet Tees: Used for aed queries ad range counting 11. Kd-Trees and Related Structures 4 kd. nees(-Oemensional Tes} Used regio pals in akedimerina space ‘+ ach evel ofthe spt the spce along specie dmersion. + 200d for eset ego sere. + avian 1 bal Tees Used for cstering ae ears neighbor search “+ Retiens Ue fost databace 1 Aplicaons:1 Geographic mapping systems Conclusion ‘Thestudy of tie structures ont a ange queries ian computational geomet ard -evousapltons. Intra reer ane Segment Tee or funsamantl ffir intel management Higher Dimesional Secures ike Kd Tee ard Range Tes ae it fr mubiimesions emt tytrié suc and augmentation techies lw for more spedalaed sppesions ‘ould you ke adtional explanations example inglementations? 602 > 069. W B Sv Conpsownancey B01 Q rason o