Pages that link to "Item:Q1931284"
From MaRDI portal
The following pages link to Space/query-time tradeoff for computing the visibility polygon (Q1931284):
Displaying 11 items.
- A space-time trade-off for computing the visibility polygon in the multi-pass model (Q780246) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Visibility queries and maintenance in simple polygons (Q1611059) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Continuous visible query for three-dimensional objects in spatial databases (Q1793439) (← 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)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Weak visibility counting in simple polygons (Q2351072) (← links)
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem (Q2817863) (← links)