activity
20172025
collaborators

10 papers

cs.CG2025

Line Aspect Ratio

Arash Vaezi

We address the problem of covering a target segment using a finite set of guards placed on a source segment within a simple polygon $\…

cs.CC2023

Quantum Complexity vs Classical Complexity: A Survey

Arash Vaezi, Ali Movaghar, Mohammad Ghodsi +3

Scientists have demonstrated that quantum computing has presented novel approaches to address computational challenges, each varying in complexity. Adapting problem-solving strateg…

cs.MA2022

Agent-Cells with DNA Programming: A Dynamic Decentralized System

Arash Vaezi

This paper introduces a new concept. We intend to give life to a software agent. A software agent is a computer program that acts on a user's behalf. We put a DNA inside the agent.…

cs.CG2022

Trajectory Range Visibility

Seyed Mohammad Hussein Kazemi, Arash Vaezi, Mohammad Ali Abam +1

Consider two entities with constant but not necessarily equal velocities, moving on two given piece-wise linear trajectories inside a simple polygon . The Trajectory Range Visib…

cs.CR2022

The Loop of the Rings: A Fully Decentralized Cooperative System (The Concept)

Arash Vaezi, Amir Daneshgar

We introduce , a secure, fully decentralized, and distributed cooperative system, where stands for "the Loop of the Rings". Distinct from conventional transaction-orient…

cs.CG2021

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery

Arash Vaezi, Mohammad Ghodsi

Given a simple polygon , in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can s…

cs.CG2021

Art Gallery Plus Single Specular-reflection

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

Given a simple polygon , in the Art Gallery problem, the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can…

cs.CG2020

Visibility Extension via Reflection

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi

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 l…

cs.CC2018

Visibility Extension via Reflective Edges to an Exact Quantity

Arash Vaezi, Mohammad Ghodsi

We consider extending the visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several variations of t…

cs.CG2017

Expanding Visibility Polygons by Mirrors upto at least K units

Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi +1

We consider extending visibility polygon of a given point , inside a simple polygon by converting some edges of to mirrors. We will show that several va…