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

Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    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 languageEnglish
    Title of host publicationProc. 30th European Workshop on Computational Geometry
    Publication statusPublished - 2014

    Keywords

    • CG, GIS, IMP

    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