Space/query-time tradeoff for computing the visibility polygon

DOI10.1016/j.comgeo.2012.10.004zbMath1259.65037OpenAlexW2103417168MaRDI QIDQ1931284

Mohammad Ghodsi, Mostafa Nouri-Baygi

Publication date: 25 January 2013

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.10.004

zbMATH Keywords

computational geometryvisibility polygonlogarithmic query timespace/query-time tradeoff

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

Randomized approximation algorithms for planar visibility counting problem ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Continuous visible query for three-dimensional objects in spatial databases ⋮ An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem ⋮ Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane ⋮ Visibility testing and counting ⋮ Weak visibility counting in simple polygons

This page was built for publication: Space/query-time tradeoff for computing the visibility polygon