6 citations · 23 across the 14 of their papers we have counts for
10 papers · 1 filter
Implementation of polygon guarding algorithms for art gallery problems
Shiva Maleki, Ali Mohades
Victor Klee introduce the art gallery problem during a conference in Stanford in August 1976 with that question: "How many guards are required to guard an art gallery?" In 1987, Gh…
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…
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…
A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon
Pardis Kavand, Ali Mohades, Mohammad Reza Kazemi
In this paper we study the problem of computing the geodesic center of a simple polygon when the available workspace is limited. For an -vertex simple polygon, we give a time-sp…
An upper bound for min-max angle of polygons
Saeed Asaeedi, Farzad Didehvar, Ali Mohades
Let be a set of points in the plane, be the set of all simple polygons crossing , be the maximum angle of polygon and $θ=min_{P\in\wp(S)} γ…
Largest and Smallest Area Triangles on Imprecise Points
Vahideh Keikha, Maarten Löffler, Ali Mohades
Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the are…
Fast Frechet Distance Between Curves With Long Edges
Joachim Gudmundsson, Majid Mirzanezhad, Ali Mohades +1
Computing the Fréchet distance between two polygonal curves takes roughly quadratic time. In this paper, we show that for a special class of curves the Fréchet distance computation…
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…
Maximum-Area Quadrilateral in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the…
Alpha-Concave Hull, a Generalization of Convex Hull
Saeed Asaeedi, Farzad Didehvar, Ali Mohades
Bounding hull, such as convex hull, concave hull, alpha shapes etc. has vast applications in different areas especially in computational geometry. Alpha shape and concave hull are…