Feb 16, 2019 · We study the problem of approximating the probability that p and q can see each other; i.e., that the segment connecting p and q does not cross ...

Feb 23, 2014 · Title:Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). Authors:Kevin Buchin ...

To solve this problem, we approximate each density function by a weighted set of polygons; a novel approach to dealing with probability density functions in ...

Jul 1, 2019 · Consider, for example, a situation where we wish to model visibility between imprecise points among obstacles. When both points are given by a ...

To solve this problem, we first approximate each density function by a weighted set of polygons. Then we focus on computing the visibility between two points ...

Region-based approximation of probability distributions (for visibility between imprecise points among obstacles). K. Buchin, I. Kostitsyna, M. Löffler, R.I. ...

The problem of approximating the probability that p and q can see each other amidst a set of obstacles of total complexity m can be approximated within ...

Let p and q be two imprecise points, given as prob- ability density functions on R2, and let R be a set of n line segments in R2. We study the problem of.

We study the problem of approximating the probability that $p$ and $q$ can see each other; that is, that the segment connecting $p$ and $q$ does not cross any ...

Let p and q be two imprecise points, given as probability density functions on R2, and let O be a set of disjoint polygonal obstacles in R2.