Bahareh Banyassady

activity

20162022

most citedA Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon

11 citations · 24 across the 4 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.CG2017

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 $S$ of $n$ point-sites in the plane. More precisely, we assume that $S$ resides in a ran…

cs.CG2017

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer +4

Let $P$ be a planar set of $n$ sites in general position. For $k \in {1, \dots, n - 1}$ , the Voronoi diagram of order $k$ for $P$ is obtained by subdividing the plane into cells such t…

cs.CG2017★ 5 cited

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 $P$ with $n$ vertices and $h$ holes. We may preprocess $P$ to obtain a label and…