2026-04-13T19:32:37Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/272742025-07-17T09:32:38Zcom_2072_1033col_2072_452950

00925njm 22002777a 4500 dc Buchin, Kevin author Kostitsyna, Irina author Löffler, Maarten author Silveira, Rodrigo Ignacio author 2014 Let p and q be two imprecise points, given as prob- ability 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 Peer Reviewed Postprint (published version) Àrees temàtiques de la UPC::Matemàtiques i estadística::Probabilitat Probabilities Probabilitats 60B Teoria de la probabilitat en estructures algebraiques i topològiques Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)