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

DOI10.1007/S00453-019-00551-2MaRDI QIDQ2415360zbMATH OpenOpenAlexWikidataFDO

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

Publication date 21 May 2019

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1402.5681

zbMATH Keywords

Gaussian distributionprobability distributionvisibility in polygonal domains

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Let $p$ and $q$ be two imprecise points, given as probability density functions on $mathbb{R}^2$, and let $calR$ be a set of $n$ line segments (obstacles) in $mathbb{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 $calR$. 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.

Recommendations

• Region-based approximation algorithms for visibility between imprecise locations
• Visibility testing and counting for uncertain segments
• Randomized approximation algorithms for planar visibility counting problem
• Visibility testing and counting
• On boundaries of highly visible spaces and applications.

Cites work

• scientific article; zbMATH DE number 1786519 (Why is no real title available?)
• Almost-Delaunay simplices, nearest neighbor relations for imprecise points
• Computational geometry. Algorithms and applications.
• Constructing strongly convex approximate hulls with inaccurate primitives
• Geometric Computations on Indecisive Points
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Region-based approximation algorithms for visibility between imprecise locations
• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Shape Fitting on Point Sets with Probability Distributions

Cited in

(5)

• Region-based approximation algorithms for visibility between imprecise locations
• Visibility testing and counting for uncertain segments
• Multiobserver multitarget visibility probabilities for poisson shadowing processes in the plane
• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Peeling potatoes near-optimally in near-linear time

Describes a project that uses

Uses Software

• Trio

This page was built for publication: Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415360)