Pages that link to "Item:Q4326861"

The following pages link to An Optimal Algorithm for Computing Visibility in the Plane (Q4326861):

Displayed 14 items.

• Planar lower envelope of monotone polygonal chains (Q495682) ‎ (← links)
• Computing the visibility polygon of an island in a polygonal domain (Q513290) ‎ (← links)
• Visibility queries in a polygonal region (Q833709) ‎ (← links)
• Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) ‎ (← links)
• Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) ‎ (← links)
• Reachable region query and its applications (Q2201650) ‎ (← links)
• Trajectory planning for an articulated probe (Q2206741) ‎ (← links)
• Visibility and ray shooting queries in polygonal domains (Q2261573) ‎ (← links)
• Query point visibility computation in polygons with holes (Q2462733) ‎ (← links)
• A linear time algorithm to remove winding of a simple polygon (Q2489541) ‎ (← links)
• Incremental Algorithms to Update Visibility Polygons (Q2971649) ‎ (← links)
• Smoothing the Gap Between NP and ER (Q5071086) ‎ (← links)
• Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) ‎ (← links)
• Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) ‎ (← links)