A near optimal algorithm for finding Euclidean shortest path in polygonal domain

نویسندگان

  • Rajasekhar Inkulu
  • Sanjiv Kapoor
  • S. N. Maheshwari
چکیده

We present an algorithm to find an Euclidean Shortest Path from a source vertex s to a sink vertex t in the presence of obstacles in R. Our algorithm takes O(T +m(lgm)(lg n)) time and O(n) space. Here, O(T ) is the time to triangulate the polygonal region, m is the number of obstacles, and n is the number of vertices. This bound is close to the known lower bound of O(n+m lgm) time and O(n) space. Our approach involve progressing shortest path wavefront as in continuous Dijkstra-type method, and confining its expansion to regions of interest.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane

Given a point s and a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we present a new algorithm for building an L1 shortest path map of size O(n) in O(T ) time and O(n) space such that for any query point t, the length of the L1 shortest obstacleavoiding path from s to t can be reported in O(log n) time and the actual shortest path can be found in additional ...

متن کامل

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane

Given a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we study the problem of computing an L1 (or rectilinear) shortest path between two points avoiding the obstacles. Previously, this problem has been solved in O(n log n) time and O(n) space, or alternatively in O(n + h log n) time and O(n + h log h) space. A lower bound of Ω(n + h log h) time and Ω(n) spac...

متن کامل

Two optimal algorithms for finding bi-directional shortest path design problem in a block layout

In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...

متن کامل

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles

Given a set P of non-intersecting polygonal obstacles in R defined with n vertices, we compute a sketch Ω of P whose size is independent of n. We utilize Ω to devise an algorithm to compute a (1 + )-approximate Euclidean shortest path between two points given with the description of P. When P comprises of convex polygonal obstacles, we devise a (2 + )approximation algorithm to efficiently answe...

متن کامل

An Optimal Algorithm for L1 Shortest Paths Among Obstacles in the Plane (Draft)

We present an optimal Θ(n log n) algorithm for determining shortest paths according to the L1 (L∞) metric in the presence of disjoint polygonal obstacles in the plane. Our algorithm requires only linear O(n) space to build a planar subdivision (a Shortest Path Map) with respect to a fixed source point such that the length of a shortest path from the source to any query point can be reported in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1011.6481  شماره 

صفحات  -

تاریخ انتشار 2010