Abstract
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. We study the problem of approximating the probability that p and q can see each other; i.e., that the segment connecting p and
... read more