9 citations · 48 across the 8 of their papers we have counts for
5 papers · 1 filter
Guarding Path Polygons with Orthogonal Visibility
Hamid Hoorfar, Alireza Bagheri
We are interested in the problem of guarding simple orthogonal polygons with the minimum number of -guards. The interior point belongs an orthogonal polygon is vis…
Special Guards in Chromatic Art Gallery
Hamid Hoorfar
We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards…
Minimum Hidden Guarding of Histogram Polygons
Hamid Hoorfar, Alireza Bagheri
A hidden guard set is a set of point guards in polygon that all points of the polygon are visible from some guards in under the constraint that no two guards may…
A Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Hamid Hoorfar, Alireza Bagheri
Given an orthogonal polygon with vertices, the goal of the watchman route problem is finding a path of the minimum length in such that every point of the po…
Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons
Hamid Hoorfar, Alireza Bagheri
Given a graph with vertices and a set of points in the plane, a point-set embedding of on is a planar drawing such that each vertex of is…