1 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
On approximations to minimum link visibility paths in simple polygons
Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari
We investigate a practical variant of the well-known polygonal visibility path (watchman) problem. For a polygon , a minimum link visibility path is a polygonal visibility path…
A sufficient condition for visibility paths in simple polygons
Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari
The purpose of this note is to give a simple proof for a necessary and sufficient condition for visibility paths in simple polygons. A visibility path is a curve such that every po…
Query-points visibility constraint minimum link paths in simple polygons
Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari
We study the query version of constrained minimum link paths between two points inside a simple polygon with vertices such that there is at least one point on the path, vis…
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
Mohammad Reza Zarrabi, Nasrollah Moghaddam Charkari
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…