A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
We propose an algorithm to ÿnd the shortest boundary guard of a simple polygon P in O(n log n) time, where n is the number of vertices of P. c 2001 Published by Elsevier Science B.V. ... In this paper, we consider a new type of guard, boundary guard, which is a guard capable of moving along a boundary of a polygon and every interior point of the polygon can be seen by the mobile guard. ... There always exists a boundary guard of any simple polygon; in worst cases, a mobile guard traverse the whole boundary of a simple polygon. The paper is organized into six sections. ...doi:10.1016/s0304-3975(00)00235-8 fatcat:ajxmddigq5gsfkdnb536q7ypra
We propose an algorithm to find the shortest boundary guard of a simple polygon 7 in O(nlogn) time, where n is the number of vertices of F.” 2002g:68156 68U10 94A08 94A24 Akman, Emir Tufan (TR-ISTUN-EL ... Martin Henk (A-TUWN-AN; Vienna) 2002g:68155 68U05 52B55 68T40 Lu, Bor-Kuan (RC-NTHU-CS; Hsinchu); Hsu, Fang-Rong ; Tang, Chuan Yi (RC-NTHU-CS; Hsinchu) Finding the shortest boundary guard of a simple polygon ...
In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygon and on its boundary are ... Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one ... The layout of the area is represented usually by a simple polygon and the objective is to find a shortest closed curve such that all the points within the polygon and on its boundary are visible to at ...arXiv:1708.01461v1 fatcat:bn4ih2l3hjfmdhht2f33ebgfuy
Lecture Notes in Computer Science
An open edge of a simple polygon is the set of points in the relative interior of an edge. ... We characterize open guard edges, and derive an algorithm that finds all open guard edges of a simple n-gon in O(n) time in the RAM model of computation. ... So all open edge guards are on the boundary of the outer polygon. By the result in  there are at most 3 closed guard edges on the outer boundary of a polygon with holes. ...doi:10.1007/978-3-642-34191-5_5 fatcat:jiw37p64hnah5i6duxmi77all4
ACM SIGACT News
Posed by Victor Klee in 1973, it asks how many stationary guards are required to see all points in an art gallery represented by a simple, n-sided polygon. ... Questions such as this one, of visibility within a polygon, are the subject of Visibility Algorithms in the Plane, by S. Ghosh. ... This query algorithm is presented, as well as query algorithms for the ray-shooting problem (given q ∈ P , find the point on the boundary of P closest to q), Euclidean shortest path, and minimum link path ...doi:10.1145/1556154.1556163 fatcat:iozevnuohncx5pbzpkntvj4fn4
We present a heuristic algorithm to arrange edge guards to guard only the inward side of the walls of any N-vertex simple polygonal gallery using at most roof (N/4) edge guards - a weakened version of ... Toussaint's conjecture on the number of edge guards that can guard an entire simple polygon. ... Algorithm Our approach to arranging edge guards to guard the boundary of the simple polygon is: Add edge guards incrementally such that after the r'th guard has been added, at least 4r edges of the polygon ...arXiv:1112.5818v3 fatcat:g22xfladzzdjnlmeshefgqth5e
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 ... Acknowledgement We would like to thank the anonymous referee for his/her valuable remarks. ...doi:10.1016/j.ipl.2004.04.010 fatcat:2vthzqpxvzc4zfznlquzwyepxm
Our computation of these metrics relies on two closely-related combinatorial strutures: the shortest-path diagram and the link diagram of a simple polygon. ... The shortest-path (resp., link) diagram encodes the Euclidean (resp., link) shortest path distance between all pairs of points on the boundary of the polygon. ... Acknowledgments The authors wish to thank Pankaj Agarwal, Helmut Alt, Danny Halperin and Micha Sharir for helpful discussions concerning the problems studied in this paper. ...doi:10.1007/s00454-002-2886-1 fatcat:au5nmiqr2zf6dnzmcc7rkfly2e
We show that even in simple polygons the shortest k-transmitter watchman route problem for a discrete set of points S⊂ P is NP-complete and cannot be approximated to within a logarithmic factor (unless ... We consider the watchman route problem for a k-transmitter watchman: standing at point p in a polygon P, the watchman can see q∈ P if pq intersects P's boundary at most k times – q is k-visible to p. ... Special Observations for k-Transmitters The first observation is that, while for 0-transmitter watchmen guarding a simple polygon's boundary is enough to guard all of the polygon, this does not hold for ...arXiv:2202.01757v1 fatcat:cp6w2o23gnb5zaka4sb5ginzwu
Summary: “Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of find- ing a shortest line segment s on the boundary of P such that P is weakly ... visible subedge of a simple polygon. ...
If we only want to see the boundary of the polygon we have the d-watchman problem which can be stated as follows: Given a simple polygon P and a point s on its boundary, find a shortest route in the interior ... Let s be a point on the boundary of P. The safari route problem is to find a shortest route in the interior of the polygon from s back to s and such that the route visits each polygon in P'. ...doi:10.1016/0925-7721(92)90014-j fatcat:jgafxgtoxbe65m5ounz5kakevq
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on boundary of the workspace ... Autonomous inspection, such as by a flying camera, or a virtual reality architectural walkthrough, could be guided by a solution to the above inspection problem. ... Murali, Jean-Claude Latombe, and the members of our research group, the Physical Computing Group at Rice, for their comments. ...doi:10.1109/robot.2000.844726 dblp:conf/icra/DannerK00 fatcat:7yhclljr7vbxrdc3ha6v4vhtuy
In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. ... Second, we consider the game played in a compact domain in Euclidean two-space with piecewise analytic boundary and arbitrary Euler characteristic. ... We thank the anonymous referee for helping us to improve the exposition. ...doi:10.26493/1855-3974.1060.031 fatcat:rkuv73wrpfbjdj63eeegx5nqvu
In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. ... Second, we consider the game played in a compact domain in Euclidean two-space with piecewise analytic boundary and arbitrary Euler characteristic. ... Acknowledgments This work was completed while the first author was a long-term visitor at the Institute for Mathematics and its Applications. ...arXiv:1505.00297v1 fatcat:5mykwsyen5g5rcv6zjspdpclhq
The bound is independent of the number of vertices or holes in the polygonal environment. ... Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. ... ., the new polygon is a subset of the previous one. 3. the paths guarded by the pursuers forming the boundary of P i+1 are both the shortest paths in P i+1 . ...doi:10.1177/0278364912452894 fatcat:a7oct6idnjdgzoraofjrhn3lfa
« Previous Showing results 1 — 15 out of 798 results