Pages that link to "Item:Q1862134"
From MaRDI portal
The following pages link to Efficient visibility queries in simple polygons (Q1862134):
Displaying 26 items.
- Planar lower envelope of monotone polygonal chains (Q495682) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- Diffuse reflection radius in a simple polygon (Q727965) (← links)
- Simulation of pedestrian route choice with local view: a potential field approach (Q823338) (← links)
- Visibility queries in a polygonal region (Q833709) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Randomized approximation algorithms for planar visibility counting problem (Q1685962) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← 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)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Visibility testing and counting (Q2346552) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Weak visibility counting in simple polygons (Q2351072) (← 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)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Algorithm 966 (Q5270778) (← links)
