Voronoi_Diagram_Notes_1

Voronoi_Diagram_Notes_1

ID:40126402

大小:83.58 KB

页数:8页

时间:2019-07-22

Voronoi_Diagram_Notes_1_第1页
Voronoi_Diagram_Notes_1_第2页
Voronoi_Diagram_Notes_1_第3页
Voronoi_Diagram_Notes_1_第4页
Voronoi_Diagram_Notes_1_第5页
资源描述:

《Voronoi_Diagram_Notes_1》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、containsqchangesasaresultoftheithinsertion.LetPidenotethisprobability(wheretheprobabilityistakenoverrandominsertionorders,irrespectiveofthechoiceofq).Sinceqcouldfallthroughuptothreelevelsinthesearchtreeasaresultofeachtheinsertion,theexpectedlengthofqssearchpathinthefinalstructureisatm

2、ostn3Pi.i=1WewillshowthatPi≤4/i.Fromthisitwillfollowthattheexpectedpathlengthisatmostn4n13=12,iii=1i=1whichisroughly12lnn=O(logn)bytheHarmonicseries.ToshowthatPi≤4/i,weapplyabackwardsanalysis.Inparticular,considerthetrapezoidthatcontainsqaftertheithinsertion.Recallfromlasttimethat

3、thistrapezoidisdependentonatmostfoursegments,whichdefinethetopandbottomedges,andtheleftandrightsidesofthetrapezoid.Sinceeachsegmentisequallylikelytobethelastsegmenttohavebeenadded,theprobabilitythatthelastinsertioncausedqtobelongtoanewtrapezoidisatmost4/i.Thiscompletestheproof.Guarant

4、eesonSearchTime:Oneshortcomingwiththisanalysisisthateventhoughthesearchtimeisprovablysmallintheexpectedcaseforagivenquerypoint,itmightstillbethecasethatoncethedatastructurehasbeenconstructedthereisasingleverylongpathinthesearchstructure,andtheuserrepeatedlyperformsqueriesalongthispat

5、h.Hence,theanalysisprovidesnoguaranteesontherunningtimeofallqueries.Althoughwewillnotproveit,thebookpresentsastrongerresult,namelythatthelengthofthemaximumsearchpathisalsoO(logn)withhighprobability.Inparticular,theyprovethefollowing.Lemma:Givenasetofnnon-crossinglinesegmentsintheplan

6、e,andaparameterλ>0,theprobabilitythatthetotaldepthoftherandomizedsearchstructureexceeds3λln(n+1),isatmost2/(n+1)λln1.25−3.Forexample,forλ=20,theprobabilitythatthesearchpathexceeds60ln(n+1)isatmost2/(n+1)1.5.(Theconstantfactorshereareratherweak,butamorecarefulanalysisleadstoabetterbou

7、nd.)Nonetheless,thisitselfisenoughtoleadtovariantofthealgorithmforwhichO(logn)timeisguaranteed.Ratherthanjustrunningthealgorithmonceandtakingwhatitgives,insteadkeeprunningitandcheckingthestructuresdepth.Assoonasthedepthisatmostclognforsomesuitablychosenc,thenstophere.Dependingoncandn

8、,theabovelem

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
相关文章
更多
相关标签