r a2 (Aedes peat ome | [ee Q_set 9 of “ny? points. [leis vakate hse dia li ng Euc! idean_aistinc | The “2d idean_distcince-—beiui Point: ee ry and eee. o5) is Skt n_by = Tf the +wo ppints are csi then E D. between thenn i LYo. ee icatio’ Contre) yesems - Ysteny for Contr i the closest werh vehicle in order to eo potentia) collision. TBis problem can be solved using Divide~ ——_aind= Conquer _apprrach _whese recurrence __ ! ee 2). h)- S6 this algoxtthno Dac for Eindlin josest pair af points Algo. I wecursively ‘ =_Ea ch wetuirsive jnve cation takes asee ea \ga/ ae firet cheaks if lpi <3. TP go + = oO Closest pair is returned, TE {ply3 then DAc applied. > =Divide i= f+ finds a vertical > line 1” that bisects poi inte wo sed P. and ep, ech xhat Pit=—Flel}oT and Hae Helfof(EN (dain) _—_Gombine - The closest _pair_is_e1ther — ; ; ‘ y_Dhe of the recursive calls. = Aig. below show they both must reside in 25- wide vertical stup line J Gnsider set of point {fr.:- fn to findNiesdbesi a seapiolae thin’ 7% ditinntm cate dine 4 ware: | ' : —= Coo} fer each conn ae Vee \ tues te find pointe n¥' that a & units of Pp Only + . ie 4a be checked Points — Rea { or Hee are ae Most