文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
侵权投诉

k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane

We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra ” paradigm to store the link distance information associated with each propagating “wavefront”. Our alg

k-LinkRectilinearShortestPathsAmongRectilinearObstaclesinthePlane

ValentinPolishchuk

JosephS.B.Mitchell

Abstract

Wepresentanalgorithmforcomputingk-linkrectilin-earshortestpathsamongrectilinearobstaclesintheplane.Weextendthe“continuousDijkstra”paradigmtostorethelinkdistanceinformationassociatedwitheachpropagating“wavefront”.OuralgorithmrunsintimeO(knlog2n)andspaceO(kn),wherenisthenum-berofverticesoftheobstacles.Previousalgorithmsfortheproblemhadworst-casetimecomplexityO(kn2).Ouralgorithmbuildsaj-linkshortestpathmap,rootedatagivensources,foreachj≤k.Ashort-estpathqueryfromstoaquerypointtcanthenbeansweredintimeO(logn+j).1

Introduction

Weconsiderthebi-criteriarectilineartwo-dimensionalshortestpathproblem:Determinearectilinearpathofminimum(L1)length,havingatmostklinks,fromstotthatavoidstheinteriorsofasetofdisjointsimplerectilinearobstacleshavingatotalofnvertices.Thebi-criteriarectilinearpathproblemnaturallyarisesincertainwire-routingapplicationsinwhichoneisinter-estedin ndingashortestrectilinearpathforawirethatavoidsagivensetofcomponentsandisconstrainedtohaveatmostklinks.RelatedWork

Bi-criteriapathproblemshavereceivedconsiderableat-tentioninthecomputationalgeometryliterature;see,e.g.,[10,11,13].ManyproblemsareknowntobeNP-hard[1],butoftenonlyweaklyso.Forthespecialcaseoftwocriteriaconsistingoflength(e.g.,L1orL2)andlinkdistance,severalpolynomial-timealgorithmsareknownforbasicgeometricoptimalpaths.See[6]forasurveyspeci ctorectilinearpathsandrectilinearobstacles,asstudiedhere.

ItischallengingtocomputeEuclideanshortestpathshavingatmostklinks,sincethereisnosimpledis-ofAppliedMathematicsandStatistics,Stony

BrookUniversity,valentin.polishchuk@stonybrook.edu

DepartmentofAppliedMathematicsandStatistics,StonyBrookUniversity,jsbm@ams.sunysb.edu.J.MitchellispartiallysupportedbygrantNo.2000160fromtheU.S.-IsraelBinationalScienceFoundation,NASAAmesResearch(NAG2-1620),theNationalScienceFoundation(CCR-0098172,ACI-0328930,CCF-0431030),andMetronAviation.

Department

cretegraphthatis“pathpreserving”foroptimalpaths.Thespecialcaseofk-linkpathsinsimplepolygonsandsomeapproximationalgorithmsformoregeneralcasesareconsideredin[12].

Inrectilinearpolygonaldomains,e cientalgorithmsareknownforthebi-criteriapathproblemthatcom-binesrectilinearlinkdistanceandL1length.Onecanachieveworst-casetimeO(kn2)(moreprecisely,O(k(m+nlogn)),wheremisanumberofcrossingsinanarrangement,andisworst-caseΘ(n2));see[6,14].Moree cientalgorithms,runninginnearlylineartime,areknownforoptimalpathsina“combinedmetric”;see[2,15]1.Resultsarealsoknowninhigherdimensionsforoptimalpathsinacombinedmetric,iftheobstaclesaregivenasasetofaxis-parallelboxes[4].

OurresultsgiveanO(knlog2n)timealgorithm,im-provingtheO(kn2)boundbyroughlyafactorofn.Weconstructafamilyofplanarsubdivisions(link-restrictedshortestpathmaps),oneforeachj=1,...,k,whichgivesadecompositionoftheplaneintocellsaccordingtothecombinatorialtypeofaj-linkshortestrectilin-earpathfromthesources.Foranyquerypointt,thelengthofashortestj-linkpathfromstotisdeterminedbylocatingtinthejthmap.2

OverviewoftheAlgorithm

Weapplythe“continuousDijkstra”paradigm[7],whichhasbeenappliedsuccessfullytosolvingmanyoptimalpathproblemsingeometry.SinceournewalgorithmisbasedonavariantofthecontinuousDijkstraalgo-rithmof[9],webeginwithareviewofthatmethodandthendescribethechangesnecessarytoextendittoourproblem.

Thealgorithmconsidersthee ectsofsweepinganad-vancing“wavefront”fromasourcepointstoallpointsoffreespaceF.(ThewavefrontatdistanceDisthesetofpointspofFforwhichtheshortestpathlengthfromstopisD.)Inordertosimulatetheadvancement

ofthesenearly-lineartimeresultsaresaidtoapplyto

optimizinganynondecreasingfunctionf(l,j)oftheL1lengthlandthenumberoflinksj;however,wesuspectthereisamis-understanding,sinceonecouldseeminglyapplythisresulttothefunctionf(l,j)thatislifj≤kand∞otherwise,givinganearly-lineartimealgorithm(independentofk)forthek-linkshortestrectilinearpath.ThealgorithmsarebasedonapplyingDijkstra’salgorithminasingle-criterionweightedgraph,ratherthanadynamicprogram(e.g.,Bellman-Ford)thatsearchesforshortestj-linkpaths.

1Some

1

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email