A Simple Shortest Path Algorithm for L-visible Polygons
نویسندگان
چکیده
منابع مشابه
Shortest Inspection-Path Queries in Simple Polygons
We want to preprocess a simple n-vertex polygon P to quickly determine the shortest path from a fixed source point s ∈ P to some point visible from a query point q ∈ P . We call such queries inspection-path queries. We give an algorithm that computes a data structure which answers the queries in logarithmic time. The data structure has O(n) size and can be computed in O(n logn) time.
متن کاملA Simple Shortest Path Algorithm with Linear Average Time
We present a simple shortest path algorithm. If the input lengths are positive and uniformly distributed, the algorithm runs in linear time. The worst-case running time of the algorithm is O(m + n logC), where n and m are the number of vertices and arcs of the input graph, respectively, and C is the ratio of the largest and the smallest nonzero arc length.
متن کاملA New Algorithm for the Shortest Path of Touring Disjoint Convex Polygons
Given a start point s, a target point t, and a sequence of k disjoint convex polygons in the plane, finding the shortest path from s to t which visits each convex polygon in the given order is our focus. In this paper, we present an improved method to compute the shortest path based on the last step shortest path maps by Dror et al. Instead of using of point location in previous algorithm, we p...
متن کاملApproximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is to find a shortest path such that it starts at p, then visits these polygons in the given order, and ends at q. This paper describes four approximation algorithms for unconstrained versions of problems defined by tour...
متن کاملChoosing a Shortest Path Algorithm
Computation of shortest paths is an integral component of many applications such as transportation planning and VLSI design. Frequently, a shortest path algorithm is selected for a given application based on the performance of the algorithm for a set of test networks. The performance of this algorithm, however, can be signiicantly diierent for networks not included in the test set. Therefore, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of information and communication convergence engineering
سال: 2010
ISSN: 2234-8255
DOI: 10.6109/jicce.2010.8.1.059