AVArash Vaezi
Arash Vaezi
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Arash Vaezi has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
Mohammad Ghodsi
3 shared publications- Mohammad Ghodsi
Sharif University of Technology
3 shared publications - Bodhayan Roy
Indian Institute of Technology Kharagpur, Kharagpur, India
2 shared publications Bodhayan Roy
1 shared publication
Latest Publications
- 22 January 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1031
Visibility extension via reflection
- 22 January 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1031
Visibility extension via reflection
- Open Access
Visibility Extension via Reflection
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first, we consider one guard as a point viewer, and we intend to use reflection to add a certain amount of area to the visibility polygon of the guard. We study visibility with specular and diffuse reflections where the specular type of reflection is the mirror-like reflection, and in the diffuse type of reflection, the angle between the incident and reflected ray may assume all possible values between $0$ and $\pi$. Lee and Aggarwal already proved that several versions of the general Art Gallery problem are $NP$-hard. We show that several cases of adding an area to the visible area of a given point guard are $NP$-hard, too. Second, we assume all edges are reflectors, and we intend to decrease the minimum number of guards required to cover the whole gallery. Chao Xu proved that even considering $r$ specular reflections, one may need $\lfloor \frac{n}{3} \rfloor$ guards to cover the polygon. Let $r$ be the maximum number of reflections of a guard's visibility ray. In this work, we prove that considering $r$ \emph{diffuse} reflections, the minimum number of \emph{vertex or boundary} guards required to cover a given simple polygon $\cal P$ decreases to { $\bf \lceil \frac{\alpha}{1+ \lfloor \frac{r}{8} \rfloor} \rceil$}, where $\alpha$ indicates the minimum number of guards required to cover the polygon without reflection. We also generalize the $\mathcal{O}(\log n)$-approximation ratio algorithm of the vertex guarding problem to work in the presence of reflection.Open AccessVisibility Extension via Reflection
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first, we consider one guard as a point viewer, and we intend to use reflection to add a certain amount of area to the visibility polygon of the guard. We study visibility with specular and diffuse reflections where the specular type of reflection is the mirror-like reflection, and in the diffuse type of reflection, the angle between the incident and reflected ray may assume all possible values between $0$ and $\pi$. Lee and Aggarwal already proved that several versions of the general Art Gallery problem are $NP$-hard. We show that several cases of adding an area to the visible area of a given point guard are $NP$-hard, too. Second, we assume all edges are reflectors, and we intend to decrease the minimum number of guards required to cover the whole gallery. Chao Xu proved that even considering $r$ specular reflections, one may need $\lfloor \frac{n}{3} \rfloor$ guards to cover the polygon. Let $r$ be the maximum number of reflections of a guard's visibility ray. In this work, we prove that considering $r$ \emph{diffuse} reflections, the minimum number of \emph{vertex or boundary} guards required to cover a given simple polygon $\cal P$ decreases to { $\bf \lceil \frac{\alpha}{1+ \lfloor \frac{r}{8} \rfloor} \rceil$}, where $\alpha$ indicates the minimum number of guards required to cover the polygon without reflection. We also generalize the $\mathcal{O}(\log n)$-approximation ratio algorithm of the vertex guarding problem to work in the presence of reflection. - 13 March 2023
- Published by Springer Nature
- p. 78-89
Reflective Guarding a Gallery
- Open Access
- 1 October 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 789, 22-33
Visibility extension via mirror-edges to cover invisible segments
- 1 October 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 789, 22-33
Open AccessVisibility extension via mirror-edges to cover invisible segments
- Open Access
Visibility Extension via Reflective Edges to an Exact Quantity
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$ units of area to $VP(q)$ are NP-complete. The optimal cases are NP-hard. We are unaware of any result on adding an exact number to a polygon, or covering an area with an exact surface. We deal with both single and multiple reflecting mirrors for both specular or diffuse types of reflections.Open AccessVisibility Extension via Reflective Edges to an Exact Quantity
We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$ units of area to $VP(q)$ are NP-complete. The optimal cases are NP-hard. We are unaware of any result on adding an exact number to a polygon, or covering an area with an exact surface. We deal with both single and multiple reflecting mirrors for both specular or diffuse types of reflections. - 21 February 2017
- Published by Springer Nature
- p. 42-53
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments
- 21 February 2017
- Published by Springer Nature
- p. 42-53
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments