- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Bahareh Banyassady, Matias Korman, +4 authors Yannik Stein
- JoCG
- 2018

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 that points in… (More)

- Bahareh Banyassady, Matias Korman, Wolfgang Mulzer
- SIGACT News
- 2018

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 their task. We survey… (More)

We study the problem of computing the k-visibility region in the memory-constrained model. In this model, the input resides in a randomly accessible read-only memory of O(n) words, with \(O(\log… (More)

- Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
- LATIN
- 2017

In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In… (More)

Let \(\mathcal D\) be a set of disks and G be the intersection graph of \(\mathcal D\). A drawing of G is obedient to \(\mathcal D\) if every vertex is placed in its corresponding disk. We show that… (More)

Let P be a simple polygon with n vertices, and let q ∈ P be a point in P . Let k ∈ {0, . . . , n− 1}. A point p ∈ P is k-visible from q if and only if the line segment pq crosses the boundary of P at… (More)

- Bahareh Banyassady, Matias Korman, Wolfgang Mulzer
- ArXiv
- 2018

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 their task. We survey… (More)

- Bahareh Banyassady, Matias Korman, +4 authors Yannik Stein
- STACS
- 2017

Let P be a planar n-point set in general position. For k between 1 and n-1, the Voronoi diagram of order k is obtained by subdividing the plane into regions such that points in the same cell have the… (More)

- Bahareh Banyassady, Man-Kwun Chiu, +7 authors Max Willert
- ISAAC
- 2017

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 a routing table… (More)