11 citations · 24 across the 4 of their papers we have counts for
6 papers · 1 filter
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
Bahareh Banyassady, Mark de Berg, Karl Bringmann +6
We consider the unlabeled motion-planning problem of unit-disc robots moving in a simple polygonal workspace of edges. The goal is to find a motion plan that moves the robo…
Geometric Algorithms with Limited Workspace: A Survey
Bahareh Banyassady, Matias Korman, Wolfgang Mulzer
In the limited workspace model, we consider algorithms whose input resides in read-only memory and that use only a constant or sublinear amount of writable memory to accomplish the…
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set of point-sites in the plane. More precisely, we assume that resides in a ran…
Improved Time-Space Trade-offs for Computing Voronoi Diagrams
Bahareh Banyassady, Matias Korman, Wolfgang Mulzer +4
Let be a planar set of sites in general position. For , the Voronoi diagram of order for is obtained by subdividing the plane into cells such t…
Routing in Polygonal Domains
Bahareh Banyassady, Man-Kwun Chiu, Matias Korman +7
We consider the problem of routing a data packet through the visibility graph of a polygonal domain with vertices and holes. We may preprocess to obtain a label and…
A Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon
Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose +2
Let be a simple polygon with vertices, and let be a point in . Let . A point is -visible from if and only if the li…