Visibility queries and maintenance in simple polygons
From MaRDI portal
Publication:1611059
DOI10.1007/s00454-001-0089-9zbMath1008.68144MaRDI QIDQ1611059
Publication date: 20 August 2002
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-001-0089-9
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Weak visibility queries of line segments in simple polygons and polygonal domains, Dynamic Algorithms for Visibility Polygons in Simple Polygons, On Romeo and Juliet Problems: Minimizing Distance-to-Sight., Space–Query-Time Tradeoff for Computing the Visibility Polygon, Kinetic Geodesic Voronoi Diagrams in a Simple Polygon, Planar lower envelope of monotone polygonal chains, Diffuse reflection radius in a simple polygon, Visibility queries in a polygonal region, Near optimal line segment queries in simple polygons, Randomized approximation algorithms for planar visibility counting problem, Computing the \(k\)-visibility region of a point in a polygon, Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane, Visibility and ray shooting queries in polygonal domains, Visibility testing and counting, Weak visibility queries of line segments in simple polygons, Query point visibility computation in polygons with holes, An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem, Incremental Algorithms to Update Visibility Polygons, Visibility Testing and Counting
