Corpus ID: 214714254

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

@article{Zarrabi2020SinglePointVC,
  title={Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons},
  author={Mohammad R. Zarrabi and Nasrollah Moghaddam Charkari},
  journal={ArXiv},
  year={2020},
  volume={abs/2003.12778}
}
  • Mohammad R. Zarrabi, Nasrollah Moghaddam Charkari
  • Published 2020
  • Computer Science
  • ArXiv
  • We address the following problem: Given a simple polygon P with n vertices and two points s and t inside it, find a minimum link path between them such that a given target point q is visible from at least one point on the path. The method is based on partitioning a portion of P into a number of faces of equal link distance from a source point. This partitioning is essentially a shortest path map (SPM). In this paper, we present an optimal algorithm with O(n) time bound, which is the same as the… CONTINUE READING
    Query-points visibility constraint minimum link paths in simple polygons
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES
    A linear time algorithm with minimum link paths inside a simple polygon
    111
    On some link distance problems in a simple polygon
    • S. Suri
    • Computer Science, Mathematics
    • 1990
    61
    Computing the Visibility Polygon from a Convex Set and Related Problems
    • S. Ghosh
    • Mathematics, Computer Science
    • 1991
    50
    Corrections to Lee's visibility polygon algorithm
    109
    Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon
    22
    Link Distance Problems
    50
    Logarithmic-time link path queries in a simple polygon
    18
    Minimal Link Visibility Paths Inside a Simple Polygon
    24
    Minimum-link paths among obstacles in the plane
    36
    Optimal Point Location in a Monotone Subdivision
    371