Pages that link to "Item:Q1611059"
From MaRDI portal
The following pages link to Visibility queries and maintenance in simple polygons (Q1611059):
Displaying 19 items.
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Computing the \(k\)-visibility region of a point in a polygon (Q2032289) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Visibility Testing and Counting (Q3004687) (← links)
- Weak visibility queries of line segments in simple polygons and polygonal domains (Q4641577) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
