Spiderman graph: visibility in urban regions

DOI10.1016/J.COMGEO.2014.10.004MaRDI QIDQ482349zbMATH OpenOpenAlexFDO

Authors Paz Carmi, Eran Friedman, Matthew J. Katz

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)

Recommendations

• A fast algorithm for computing sparse visibility graphs
• scientific article; zbMATH DE number 1182918
• Computing the visibility graph of points within a polygon
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles

Cites work

• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• An optimal visibility graph algorithm for triangulated simple polygons
• Making data structures persistent
• Topologically sweeping visibility complexes via pseudotriangulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482349)