Visibility testing and counting for uncertain segments

DOI10.1016/j.tcs.2019.01.035zbMath1422.68228OpenAlexW2911942690WikidataQ128451321 ScholiaQ128451321MaRDI QIDQ2420576

Mohammad Ghodsi, Mohammad Mahdian, Mohammad Ali Abam, Sharareh Alipour

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.01.035

zbMATH Keywords

approximation algorithmrandomized algorithmvisibilitycomputational geometryprobabilistic segments

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles

Cites Work

• The complexity of computing the permanent
• Approximating largest convex hulls for imprecise points
• Applications of a new space-partitioning technique
• Randomized approximation algorithms for planar visibility counting problem
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Visibility testing and counting
• Region-based approximation of probability distributions (for visibility between imprecise points among obstacles)
• Visibility Testing and Counting
• Algorithms for ray-shooting and intersection searching
• Smallest enclosing ball for probabilistic data
• The visibility diagram: A data structure for visibility problems and motion planning
• Piecewise-Linear Approximations of Uncertain Functions
• Planar visibility

This page was built for publication: Visibility testing and counting for uncertain segments