Please use this identifier to cite or link to this item:
|Title:||Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)|
|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.|
|Appears in Collections:||CIDMA - Comunicações|
OGTCG - Comunicações
Files in This Item:
|monkeys-eurocg-final.pdf||article||343.3 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.