Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
Computational Geometry
2021-03-02 v4 Data Structures and Algorithms
Abstract
We address the following problem: Given a simple polygon with vertices and two points and inside it, find a minimum link path between them such that a given target point is visible from at least one point on the path. The method is based on partitioning a portion of 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 time bound, which is the same as the time complexity of the standard minimum link paths problem.
Cite
@article{arxiv.2003.12778,
title = {Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons},
author = {Mohammad Reza Zarrabi and Nasrollah Moghaddam Charkari},
journal= {arXiv preprint arXiv:2003.12778},
year = {2021}
}