Pages that link to "Item:Q1262133"
From MaRDI portal
The following pages link to A fast algorithm for computing sparse visibility graphs (Q1262133):
Displaying 7 items.
- Spiderman graph: visibility in urban regions (Q482349) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Minimal tangent visibility graphs (Q1924714) (← links)
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane (Q2970428) (← links)
- Visualizing Sparse Filtrations. (Q5368672) (← links)