Abstract
Let $p$ and $q$ be two imprecise points, given as probability density functions on $R^2$, and let $R$ be a set of $n$ line segments in $R^2$. We approximate the probability that $p$ and $q$ can see each other; that is, that the segment connecting $p$ and $q$ does not cross any segment of $R$. 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 computational geometry.
Original language | English |
---|---|
Title of host publication | Proc. 30th European Workshop on Computational Geometry |
Publication status | Published - 2014 |
Keywords
- CG, GIS, IMP