Visibility and Ray Shooting Queries in Polygonal Domains
From MaRDI portal
Publication:2842161
DOI10.1007/978-3-642-40104-6_22zbMATH Open1390.68714OpenAlexW2136884464MaRDI QIDQ2842161FDOQ2842161
Authors: Danny Z. Chen, Haitao Wang 
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_22
Recommendations
- Visibility and ray shooting queries in polygonal domains
- Quickest visibility queries in polygonal domains
- Quickest visibility queries in polygonal domains
- Visibility queries and maintenance in simple polygons
- Efficient visibility queries in simple polygons
- Visibility queries in a polygonal region
- Visibility polygon queries among dynamic polygonal obstacles in plane
- scientific article; zbMATH DE number 176772
- Ray shooting in polygons using geodesic triangulations
- Query point visibility computation in polygons with holes
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (9)
- Visibility queries in a polygonal region
- Hierarchical decompositions and circular ray shooting in simple polygons
- Query point visibility computation in polygons with holes
- Visibility and ray shooting queries in polygonal domains
- Title not available (Why is that?)
- Guarding orthogonal art galleries with sliding cameras
- Visibility testing and counting
- Computing the visibility polygon of an island in a polygonal domain
- Efficient computation of query point visibility in polygons with holes
This page was built for publication: Visibility and Ray Shooting Queries in Polygonal Domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842161)
