Touring a sequence of polygons
Alon Efrat2003
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Given a sequence of k polygons in the plane, a start point s, and a target point, t, we seek a shortest path that starts at s, visits in order each of the polygons, and ends at t. If the polygons are disjoint and convex, we give an algorithm running in time O(kn log(n/k)), where n is the total number of vertices specifying the polygons. We also extend our results to a case in which the convex polygons are arbitrarily intersecting and the subpath between any two consecutive polygons is constrained to lie within a simply connected region; the algorithm uses O(nk 2 log n) time. Our methods are simple and allow shortest path queries from s to a query point t to be answered in time O(k log n + m), where m is the combinatorial path length. We show that for nonconvex polygons this "touring polygons" problem is NP-hard.
Related papers
Shortest paths in simple polygons with polygon-meet constraints
2004
We study a constrained version of the shortest path problem in simple polygons, in which the path must visit a given target polygon. We provide a worst-case optimal algorithm for this problem and also present a method to construct a subdivision of the simple polygon to efficiently answer queries to retrieve the shortest polygon-meeting paths from a single-source to the query point. The algorithms are linear, both in time and space, in terms of the complexity of the two polygons.
Finding the Shortest Watchman Route in a Simple Polygon
1993
We present the first polynomial-time algorithm that finds the shortest route in a simple polygon such that all points of the polygon is visible from some point on the route. This route is sometimes called the shortest watchman route, and it does not allow any restrictions on the route or on the simple polygon. Our algorithm runs in O(n 3) time.
Query-point visibility constrained shortest paths in simple polygons
2007
In this paper, we study the problem of finding the shortest path between two points inside a simple polygon such that there is at least one point on the path from which a query point is visible. We provide an algorithm which preprocesses the input in O (n2+ nK) time and space and provides logarithmic query time. The input polygon has n vertices and K is a parameter dependent on the input polygon which is O (n2) in the worst case but is much smaller for most polygons.
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications, 1999
This paper presents a simple O(n+k) time algorithm to compute the set of knon-crossing shortest paths between k source-destination pairs of points on the boundary of a simple polygon of n vertices. Paths are allowed to overlap but are not allowed to cross in the plane. A byproduct of this result is an O(n) time algorithm to compute a balanced geodesic triangulation which is easy to implement. The algorithm extends to a simple polygon with one hole where source-destination pairs may appear on both the inner and outer boundary of the polygon. In the latter case, the goal is to compute a collection of non-crossing paths of minimum total cost. The case of a rectangular polygonal domain where source-destination pairs appear on the outer and one inner boundary12 is briefly discussed.
Memory-constrained algorithms for simple polygons
Computational Geometry, 2013
A constant-workspace algorithm has read-only access to an input array and may use only O(1) additional words of O(log n) bits, where n is the size of the input. We assume that a simple n-gon is given by the ordered sequence of its vertices. We show that we can find a triangulation of a plane straight-line graph in O(n 2 ) time. We also consider preprocessing a simple polygon for shortest path queries when the space constraint is relaxed to allow s words of working space. After a preprocessing of O(n 2 ) time, we are able to solve shortest path queries between any two points inside the polygon in O(n 2 /s) time.
Two-guard walkability of simple polygons
1998
A pair of points s and g on the boundary of a simple polygon P admits a walk if two guards can simultaneously walk along the two boundary chains of P from s to g such that they are always visible to each other. The walk is a counter-walk if one guard moves from s to g while the other moves from g to s in the same direction along the boundary and they are always visible to each other. The (counter-)walk is straight if no backtracking is necessary during the (counter-)walk. In this paper, we show that, given a polygon with n vertices, to test if there exists (s; g) that admits a (straight) (counter-)walk can be solved in time O(n log n) and in linear space. Also we compute all (s; g)'s that admit a (straight) walk in O(n log n) time and all vertex pairs that admit a (straight) counter-walk in O(n log n + m), where m is O(n 2).
Minimum-link shortest paths for polygons amidst rectilinear obstacles
Computational Geometry
Consider two axis-aligned rectilinear simple polygons in the domain consisting of axisaligned rectilinear obstacles in the plane such that the bounding boxes, one for each obstacle and one for each polygon, are disjoint. We present an algorithm that computes a minimumlink rectilinear shortest path connecting the two polygons in O((N + n) log(N + n)) time using O(N + n) space, where n is the number of vertices in the domain and N is the total number of vertices of the two polygons.
Curvature-Constrained Shortest Paths in a Convex Polygon
Siam Journal on Computing, 2002
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem for B moving between two configurations inside P (a configuration specifies both a location and a direction of travel). We present an O(n 2 log n) time algorithm for determining whether a collision-free path exists for B between two given configurations. If such a path exists, the algorithm returns a shortest one. We provide a detailed classification of curvature-constrained shortest paths inside a convex polygon and prove several properties of them, which are interesting in their own right. Some of the properties are quite general and shed some light on curvature-constrained shortest paths amid obstacles.
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
International Journal of Computational Geometry & Applications, 1993
A watchman, in the terminology of art galleries, is a mobile guard. We consider several watchman and guard problems for different classes of polygons. We introduce the notion of vision spans along a path (route) which provide a natural connection between the Art Gallery problem, the m-watchmen problem and the watchman route problem. We prove that finding the minimum number of vision points, i.e., static guards, along a shortest watchman route is NP-hard. We provide a linear time algorithm to compute the best set of static guards in a histogram polygon. The m-watchmen problem, minimize total length of routes for m watchmen, is NP-hard for simple polygons. We give a Θ(n 3 + n 2 m 2 )-time algorithm to compute the best set of m watchmen in a histogram.
Query-points visibility constraint minimum link paths in simple polygons
Fundam. Informaticae, 2021
We study the query version of constrained minimum link paths between two points inside a simple polygon P with n vertices such that there is at least one point on the path, visible from a query point. The method is based on partitioning P into a number of faces of equal link distance from a point, called a link-based shortest path map (SPM). Initially, we solve this problem for two given points s, t and a query point q. Then, the proposed solution is extended to a general case for three arbitrary query points s, t and q. In the former, we propose an algorithm with O(n) preprocessing time. Extending this approach for the latter case, we develop an algorithm with O(n3) preprocessing time. The link distance of a q-visible path between s, t as well as the path are provided in time O(log n) and O(m + log n), respectively, for the above two cases, where m is the number of links.
Related topics
Related papers
Efficient algorithms for shortest distance queries on special classes of polygons
Theoretical Computer Science
The problem of finding a rectilinear minimum bend path (RMBP) between two designated points inside a rectilinear polygon has applications in robotics and motion planning. In this paper, we present efficient algorithms to solve the query version of the RMBP problem for special classes of rectilinear polygons given their oisibility graphs. Specifically, we show that given an unweighted graph G = (V, E), with 1 VI = N and 1 E I= M, algorithms to preprocess G in linear space and time such that the shortest distance queries-queries asking for the distance between any pair of nodes in the graph-can be answered in constant time and space are presented in this paper. For the case of a chordal graph G, our algorithms give a distance which is at most one away from the actual shortest distance. When G is a K-chordal graph, our algorithm produces an exact shortest distance in O(K) time. We also present a non-trivial parallel implementation of the sequential preprocessing algorithm for the CREW-PRAM mode1 which runs in O(logz N) time using O(N + M) processors. After the preprocessing, we can answer the queries in constant time using a single processor.
Touring a Sequence of Weighted Polygons
2008
Abstract In this paper we will solve a generalization of the problem “Touring a Sequence of Polygons” where polygons can be concave and a weight is considered when visiting them. The main idea to solve the problem is triangulation of the polygons and adding some Steiner on the edges. We will also use a modified version of BUSHWHACK algorithm to find the shortest path among Steiner points. The running time of the algorithm will be O (n ϵ log 1 ϵ (log n+ log 1 ϵ)).
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
Lecture Notes in Computer Science, 2020
We present an O(nrG) time algorithm for computing and maintaining a minimum length shortest watchman tour that sees a simple polygon under monotone visibility in direction θ, while θ varies in [0, 180 •), obtaining the directions for the tour to be the shortest one over all tours, where n is the number of vertices, r is the number of reflex vertices, and G ≤ r is the maximum number of gates of the polygon used at any time in the algorithm.
AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
International Journal of Computational Geometry & Applications, 1996
We present a data structure that allows to preprocess a rectilinear polygon with n vertices such that, for any two query points, the shortest path in the rectilinear link or L 1 -metric can be reported in time O(log n + k) where k is the link length of the shortest path. If only the distance is of interest, the query time reduces to O(log n). Furthermore, if the query points are two vertices, the distance can be reported in time O(1) and a shortest path can be constructed in time O(1 + k). The data structure can be computed in time O(n) and needs O(n) storage. As an application we present a linear time algorithm to compute the diameter of a simple rectilinear polygon w.r.t. the L 1 -metric.
Optimal link path queries in a simple polygon
ACM-SIAM Symposium on Discrete Algorithms, 1992
We develop a data structure for answering link distance queries between two arbitrary points in a simple polygon. The data structure requires O(n3) time and space for its construction and answers link distance queries in O(log n) time. Our result extends to link distance queries between pairs of segments or polygons. We also propose a simpler data structure for computing
Touring a Sequence of Polygons in Weighted Regions
Abstract Given a subdivision of plane into convex polygon regions, a sequence of polygons to meet, a start point s, and a target point t, we are interested in determining the shortest weighted path on this plane which starts at s, visits each of the polygons in the given order, and ends at t. The length of a path in weighted regions is defined as the sum of the lengths of the sub-paths within each region. We will present an approximation algorithm with maximum δ cost additive.
Computing the Detour of Polygons
Let P be a simple polygon in 2 with n vertices. The detour of P between two points, p, q ∈ P , is the length of a shortest path contained in P and connecting p to q, divided by the distance of these points. The detour of the whole polygon is the maximum detour between any two points in P . We first analyze properties of pairs of points with maximum detour. Next, we use these properties to achieve a deterministic O(n 2 )-algorithm for computing the maximum Euclidean detour and a deterministic O(n log n)-algorithm which calculates a (1+ε)approximation. Finally, we consider the special case of monotone rectilinear polygons. Their L 1 -detour can be computed in time O(n).
The Polygon Exploration Problem
SIAM Journal on Computing, 2001
We present an on-line strategy that enables a mobile robot with vision to explore an unknown simple polygon. We prove that the resulting tour is less than 26.5 times as long as the shortest watchman tour that could be computed off-line. Our analysis is doubly founded on a novel geometric structure called the angle hull. Let D be a connected region inside a simple polygon, P . We define the angle hull of D, AH(D), to be the set of all points in P that can see two points of D at a right angle. We show that the perimeter of AH(D) cannot exceed in length the perimeter of D by more than a factor of 2. This upper bound is tight.
Curvature-constrained shortest paths in a convex polygon (extended abstract
1998
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem for B moving between two configurations inside P (a configuration specifies both a location and a direction of travel). We present an O(n 2 log n) time algorithm for determining whether a collision-free path exists for B between two given configurations. If such a path exists, the algorithm returns a shortest one. We provide a detailed classification of curvature-constrained shortest paths inside a convex polygon and prove several properties of them, which are interesting in their own right. Some of the properties are quite general and shed some light on curvature-constrained shortest paths amid obstacles.
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
Discrete & Computational Geometry, 1997
We give an algorithm to compute a (Euclidean) shortest path in a polygon with h holes and a total of n vertices. The algorithm uses O(n) space and requires O(n +h 2 log n) time.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.