|
Dòng
|
Nội dung
|
|
1
|
Region-Based Approximation of Probability Distributions : for Visibility Between Imprecise Points Among Obstacles / Kevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira
// Algorithmica. - Springer US. - Vol. 81, Issue 7 (Jul. 2019) p.2682-2715. - ISSN:
Ký hiệu phân loại (DDC):
Let p and q be two imprecise points, given as probability density functions on R2,and let O be a set of disjoint polygonal obstacles in R2. We study the problem ofapproximating the probability that p and q can see each other; i.e., that the segmentconnecting p and q does not cross any obstacle in O. To solve this problem, we firstapproximate each density function by a weighted set of polygons. Then we focus oncomputing the visibility between two points inside two of such polygons, where wecan assume that the points are drawn uniformly at random. We show how this problemcan be solved exactly in O((n + m)2) time, where n and m are the total complexitiesof the two polygons and the set of obstacles, respectively. Using this as a subroutine,we show that the probability that p and q can see each other amidst a set of obstaclesof total complexity m can be approximated within error ε in O(1/ε3 + m2/ε2) time.
Số bản sách:
(0)
Tài liệu số:
(0)
|
|
|
|
|