10 citations · 25 across the 18 of their papers we have counts for
5 papers · 1 filter
1-Bend RAC Drawings of 1-Planar Graphs
Walter Didimo, Giuseppe Liotta, Saeed Mehrabi +1
A graph is 1-planar if it has a drawing where each edge is crossed at most once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right angles. The relationships…
Unique Set Cover on Unit Disks and Unit Squares
Saeed Mehrabi
We study the Unique Set Cover problem on unit disks and unit squares. For a given set of points and a set of geometric objects both in the plane, the objective of t…
Sliding k-Transmitters: Hardness and Approximation
Therese Biedl, Saeed Mehrabi, Ziting Yu
A sliding k-transmitter in an orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. It can see a point p in P if the perpe…
On -Guarding Thin Orthogonal Polygons
Therese Biedl, Saeed Mehrabi
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal an…
On Guarding Orthogonal Polygons with Sliding Cameras
Therese Biedl, Timothy M. Chan, Stephanie Lee +3
A sliding camera inside an orthogonal polygon is a point guard that travels back and forth along an orthogonal line segment in . The sliding camera can see a point $…