Spiderman graph: visibility in urban regions

DOI10.1016/j.comgeo.2014.10.004zbMath1304.65104OpenAlexW2086826623MaRDI QIDQ482349

Eran Friedman, Matthew J. Katz, Paz Carmi

Publication date: 23 December 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.10.004

zbMATH Keywords

weak visibilitypersistent search treesvisibility graphs

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Visibility representations of boxes in 2.5 dimensions

Cites Work

• An optimal visibility graph algorithm for triangulated simple polygons
• Making data structures persistent
• Topologically sweeping visibility complexes via pseudotriangulations
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Spiderman graph: visibility in urban regions