Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

20

FAW
2008
Springer

favoriteEmaildiscussreport

127views Algorithms» more FAW 2008»

Visiting a Polygon on the Optimal Way to a Query Point

13 years 6 months ago

Visiting a Polygon on the Optimal Way to a Query Point

Download sharif.edu

Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm for this problem based on the wavefront propagation method and also present a method to construct a subdivision of the domain to efficiently answer queries to retrieve the constrained shortest paths from a single-source to the query point.

Ramtin Khosravi, Mohammad Ghodsi

Real-time Traffic

Algorithms | Constrained Shortest Paths | FAW 2008 | Shortest Path Problem | Shortest Paths |

claim paper

Related Content

» A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes

» Nearly Optimal ExpectedCase Planar Point Location

» Lower bounds for expectedcase planar point location

» An Empirical Study of a New Approach to Nearest Neighbor Searching

» Computing homotopic shortest paths efficiently

» A realistic model of frequencybased multirobot polyline patrolling

» Shortest path problem in rectangular complexes of global nonpositive curvature

» Exploiting a pagelevel upper bound for multitype nearest neighbor queries

» Optimal Broadcast Channel for Data Dissemination in Mobile Database Environment

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	FAW
Authors	Ramtin Khosravi, Mohammad Ghodsi

Comments (0)