Spiderman graph: Visibility in urban regions

Paz Carmi, Eran Friedman, Matthew J. Katz

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


Motivated by the inaccuracy of GPS devices in urban regions, we study the problem of computing the visibility graph of an urban region. Given a scene of buildings, where a building is represented by the set of its walls, the vertices of the graph correspond to the buildings' walls, and there is an edge between two walls if and only if they are weakly visible to each other. We present efficient algorithms for several scenes, including a sophisticated O(n2log2n)-time algorithm for a scene consisting of n walls of varying heights parallel to the yz-plane, where visibility is restricted to directions whose projections on the xy-plane are horizontal. This algorithm uses persistent search trees.

Original languageEnglish
Pages (from-to)251-259
Number of pages9
JournalComputational Geometry: Theory and Applications
Issue number3
StatePublished - 1 Jan 2015


  • Persistent search trees
  • Visibility graphs
  • Weak visibility

ASJC Scopus subject areas

  • Computer Science Applications
  • Geometry and Topology
  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Spiderman graph: Visibility in urban regions'. Together they form a unique fingerprint.

Cite this