Visibility testing and counting
From MaRDI portal
Publication:2346552
Recommendations
Cites work
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- Efficient computation of query point visibility in polygons with holes
- Efficient visibility queries in simple polygons
- Graphics in flatland revisited
- Planar visibility, testing and counting
- Space/query-time tradeoff for computing the visibility polygon
- THE VISIBILITY COMPLEX
- The visibility diagram: A data structure for visibility problems and motion planning
- Visibility Algorithms in the Plane
- Visibility and Ray Shooting Queries in Polygonal Domains
- Visibility queries and maintenance in simple polygons
- Visibility testing and counting
Cited in
(5)
This page was built for publication: Visibility testing and counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346552)