Alexis Beingessner

most citedComputing the Coverage of an Opaque Forest

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2013★ 1 cited

Computing the Coverage of an Opaque Forest

Alexis Beingessner, Michiel Smid

We consider the problem of taking an opaque forest and determining the regions that are covered by it. We provide a tight upper bound on the complexity of this problem, and an algo…

cs.CG2013★ 1 cited

Computing Covers of Plane Forests

Luis Barba, Alexis Beingessner, Prosenjit Bose +1

Let $ϕ$ be a function that maps any non-empty subset $A$ of $R^{2}$ to a non-empty subset $ϕ (A)$ of $R^{2}$ . A $ϕ$ -cover of a set $T = {T_{1}, T_{2}, \dots, T_{m}}$ of pair…