Region-based approximation algorithms for visibility between imprecise locations

DOI10.1137/1.9781611973754.9MaRDI QIDQ5232526zbMATH OpenOpenAlexFDO

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

Publication date 12 September 2019

Published in 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/regionbased-approximation-of-probability-distributions-for-visibility-between-imprecise-points-among-obstacles(873519ef-4cf6-4d8b-b35e-33ec2592a96b).html

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Randomized approximation algorithms for planar visibility counting problem
• Visibility testing and counting for uncertain segments
• Visibility testing and counting
• Computing the discrete Fréchet distance with imprecise input

Cited in

(5)

• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Regional surveillance of disjoint rectangles: a travelling salesman formulation
• scientific article; zbMATH DE number 5371223 (Why is no real title available?)
• Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard Analysis
• Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles

This page was built for publication: Region-based approximation algorithms for visibility between imprecise locations

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