Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
Publication:2415360
DOI10.1007/s00453-019-00551-2zbMath1421.68160arXiv1402.5681OpenAlexW2952063284WikidataQ128391289 ScholiaQ128391289MaRDI QIDQ2415360
Maarten Löffler, Kevin Buchin, Irina Kostitsyna, Rodrigo I. Silveira
Publication date: 21 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5681
Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Constructing strongly convex approximate hulls with inaccurate primitives
- Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
- Shape Fitting on Point Sets with Probability Distributions
- Geometric Computations on Indecisive Points
- Region-based Approximation Algorithms for Visibility between Imprecise Locations
This page was built for publication: Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)