Pages that link to "Item:Q5149571"
From MaRDI portal
The following pages link to Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571):
Displaying 10 items.
- A space-time trade-off for computing the visibility polygon in the multi-pass model (Q780246) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- Visibility queries and maintenance in simple polygons (Q1611059) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- An algorithm for dynamic Delaunay triangulation of simple polygon (Q2887614) (← links)
- New Results on Visibility in Simple Polygons (Q3183466) (← links)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762) (← links)
- (Q4371242) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)