23 citations · 51 across the 26 of their papers we have counts for
16 papers · 1 filter
An Efficient Construction of Yao-Graph in Data-Distributed Settings
Sepideh Aghamolaei, Mohammad Ghodsi
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we d…
A parallel algorithm for Delaunay triangulation of moving points on the plane
Nazanin Hadiniya, Mohammad Ghodsi
Delaunay Triangulation(DT) is one of the important geometric problems that is used in various branches of knowledge such as computer vision, terrain modeling, spatial clustering an…
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…
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…
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades +1
The -center problem is to choose a subset of size from a set of points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\l…
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…
Computing The Packedness of Curves
Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi +1
A polygonal curve with vertices is -packed, if the sum of the lengths of the parts of the edges of the curve that are inside any disk of radius is at most , for…
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…
Approximating The p-Mean Curve of Large Data-Sets
Sepideh Aghamolaei, Mohammad Ghodsi
A set of piecewise linear functions, called polylines, each with at most vertices can be simplified into a polyline with vertices, such that the Fréche…
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…
Approximate Minimum Diameter
Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin
We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is…
Clearing an Orthogonal Polygon Using Sliding Robots
Mohammad Ghodsi, Salma Sadat Mahdavi, Ali Narenji Sheshkalani
In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new…
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
Sharareh Alipour, Mohammad Ghodsi, Amir Jafari
Given a set of disjoint line segments in , the visibility counting problem (VCP) is to preprocess such that the number of segments in visible from a…
Randomized Strategy for Walking in Streets for a Simple Robot
Azadeh Tabatabaei, Mohammad Ghodsi
We consider the problem of walking in an unknown street, for a robot that has a minimal sensing capability. The robot is equipped with a sensor that only detects the discontinuitie…
Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains
Mojtaba Nouri Bygi, Mohammad Ghodsi
In this paper we consider the problem of computing the weak visibility polygon of any query line segment (or ) inside a given polygon . Our first non-trivial algor…
Near Optimal Line Segment Weak Visibility Queries in Simple Polygons
Mojtaba Nouri Bygi, Mohammad Ghodsi
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm t…