Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

K. Buchin, I. Kostitsyna, M. Löffler, R.I. Silveira

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

62 Downloads (Pure)

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 languageEnglish
Title of host publicationAbstr. 30th European Workshop on Computational Geometry (EuroCG)
Pages1-4
Publication statusPublished - 2014
Event30th European Workshop on Computational Geometry (EuroCG 2014) - Dead Sea, Israel
Duration: 3 Mar 20145 Mar 2014
Conference number: 30
https://www.cs.bgu.ac.il/~eurocg14/

Workshop

Workshop30th European Workshop on Computational Geometry (EuroCG 2014)
Abbreviated titleEuroCG 2014
CountryIsrael
CityDead Sea
Period3/03/145/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)