On rectangular visibility
From MaRDI portal
Recommendations
Cited in
(22)- On the dynamic maintenance of maximal points in the plane
- Efficient algorithms for the largest rectangle problem
- On covering orthogonal polygons with star-shaped polygons
- Parallel algorithms for permutation graphs
- Visibility in semi-convex spaces
- The rectangle of influence drawability problem
- On starshapedness in products of interval spaces
- An optimal algorithm for reporting visible rectangles
- Staircase visibility and computation of kernels
- Persistent homology in \(\ell_\infty\) metric
- The approximate rectangle of influence drawability problem
- On the enumeration of permutominoes
- Dynamic Planar Range Maxima Queries
- Ranking intervals under visibility constraints∗
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- A general approach to dominance in the plane
- Visibility of rectagular objects inL1metric
- scientific article; zbMATH DE number 1292991 (Why is no real title available?)
- Dominance in the presence of obstacles
- Finding the largest area axis-parallel rectangle in a polygon
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues
This page was built for publication: On rectangular visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796760)