2 citations · 2 across the 5 of their papers we have counts for
5 papers
Separating Colored Points with Minimum Number of Rectangles
Navid Assadian, Sima Hajiaghaei Shanjani, Alireza Zarei
In this paper we study the following problem: Given disjoint sets of points, on the plane, find a minimum cardinality set of arbitrary rectangl…
Recognizing Visibility Graphs of Triangulated Irregular Networks
Hossein Boomari Mojtaba Ostovari Alireza Zarei
A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, th…
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction
Sahar Mehrpour, Alireza Zarei
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its vi…
Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
Hossein Boomari, Mojtaba Ostovari, Alireza Zarei
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two ve…
A Simple, Faster Method for Kinetic Proximity Problems
Zahed Rahmati, Mohammad Ali Abam, Valerie King +2
For a set of points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neigh…