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 time complexity of the standard minimum link paths problem.

中文翻译：

---

简单多边形中的单点可见性约束最小链接路径

我们解决以下问题：给定一个简单的多边形 $P$，其中包含 $n$ 个顶点和其中的两个点 $s$ 和 $t$，找到它们之间的最小链接路径，使得给定的目标点 $q$ 是可见的路径上至少有一个点。该方法基于将$P$ 的一部分划分为距源点具有相等链接距离的多个面。这种划分本质上是一个最短路径图（SPM）。在本文中，我们提出了一个具有 $O(n)$ 时间界限的最优算法，它与标准最小链路路径问题的时间复杂度相同。