دوره 17، شماره 2 - ( 6-1401 )
جلد 17 شماره 2 صفحات 241-235 |
برگشت به فهرست نسخه ها
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Zarrabi M R, Moghadam Charkari N. Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons. IJMSI 2022; 17 (2) :235-241
URL: http://ijmsi.ir/article-1-1436-fa.html
URL: http://ijmsi.ir/article-1-1436-fa.html
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons. مجله علوم ریاضی و انفورماتیک. 1401; 17 (2) :235-241
چکیده:
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.
| بازنشر اطلاعات | |
 |
این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است. |
