### 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 | Israel |

City | Dead Sea |

Period | 3/03/14 → 5/03/14 |

Internet address |

## Fingerprint Dive into the research topics of 'Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)'. Together they form a unique fingerprint.

## Cite this

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

*Abstr. 30th European Workshop on Computational Geometry (EuroCG)*(pp. 1-4)