On characterizing terrain visibility graphs
From MaRDI portal
Recommendations
Cited in
(17)- Persistent graphs and cyclic polytope triangulations
- A fast shortest path algorithm on terrain-like graphs
- On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
- Vision-based terrain characerterization and traversability assessment
- Visibility maps of realistic terrains have linear smoothed complexity
- scientific article; zbMATH DE number 1161283 (Why is no real title available?)
- Reconstructing generalized staircase polygons with uniform step length
- Reconstructing generalized staircase polygons with uniform step length
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Recognizing Visibility Graphs of Triangulated Irregular Networks
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Coloring polygon visibility graphs and their generalizations
- Terrain-like graphs and the median Genocchi numbers
- Terrain visibility graphs: persistence is not enough
- One-sided terrain guarding and chordal graphs
- Colouring polygon visibility graphs and their generalizations
- Compact representation of semilinear and terrain-like graphs
This page was built for publication: On characterizing terrain visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970417)