Pages that link to "Item:Q5750463"
From MaRDI portal
The following pages link to Computing the visibility polygon from a convex set and related problems (Q5750463):
Displaying 23 items.
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Visibility with multiple diffuse reflections (Q1392849) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
- Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane (Q2084662) (← links)
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons (Q2446331) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Multiple point visibility and related problems (Q2710754) (← links)
- Incremental Algorithms to Update Visibility Polygons (Q2971649) (← links)
- Algorithms for Computing Diffuse Reflection Paths in Polygons (Q3605484) (← links)
- Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons (Q5025050) (← links)
- Parallel algorithms for all minimum link paths and link center problems (Q5056133) (← links)
- Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons (Q5056907) (← links)
- Dynamic Algorithms for Visibility Polygons in Simple Polygons (Q5149571) (← links)
- Disproving a conjecture on planar visibility graphs (Q5941094) (← links)
