On rectangular visibility

DOI10.1016/0196-6774(88)90028-4zbMath0651.68069OpenAlexW2050760156MaRDI QIDQ3796760

Mark H. Overmars, Derick Wood

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90028-4

zbMATH Keywords

computational geometryquery problemrectangular visibility

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (17)

I/O-efficient 2-d orthogonal range skyline and attrition priority queues ⋮ Staircase visibility and computation of kernels ⋮ Visibility in semi-convex spaces ⋮ The rectangle of influence drawability problem ⋮ On the Enumeration of Permutominoes ⋮ Dominance in the presence of obstacles ⋮ On the dynamic maintenance of maximal points in the plane ⋮ Finding the largest area axis-parallel rectangle in a polygon ⋮ Dynamic Planar Range Maxima Queries ⋮ Efficient algorithms for the largest rectangle problem ⋮ On covering orthogonal polygons with star-shaped polygons ⋮ A parallel algorithm to construct a dominance graph on nonoverlapping rectangles ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ On starshapedness in products of interval spaces ⋮ Persistent homology in \(\ell_\infty\) metric ⋮ Parallel algorithms for permutation graphs ⋮ The approximate rectangle of influence drawability problem

This page was built for publication: On rectangular visibility