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 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 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 | Abstr. 30th European Workshop on Computational Geometry (EuroCG) |
Pages | 1-4 |
Publication status | Published - 2014 |
Event | 30th European Workshop on Computational Geometry (EuroCG 2014) - Dead Sea, Israel Duration: 3 Mar 2014 → 5 Mar 2014 Conference number: 30 https://www.cs.bgu.ac.il/~eurocg14/ |
Workshop
Workshop | 30th European Workshop on Computational Geometry (EuroCG 2014) |
---|---|
Abbreviated title | EuroCG 2014 |
Country/Territory | Israel |
City | Dead Sea |
Period | 3/03/14 → 5/03/14 |
Internet address |