Visibility graphs of towers

DOI10.1016/0925-7721(95)00033-XzbMath0869.68112MaRDI QIDQ676570

Paul Colley, Anna Lubiw, Jeremy P. Spinrad

Publication date: 18 March 1997

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

zbMATH Keywords

towervisibility graphs of towers

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Linear-time algorithms for counting independent sets in bipartite permutation graphs ⋮ Computing the maximum clique in the visibility graph of a simple polygon ⋮ A fast shortest path algorithm on terrain-like graphs ⋮ Visibility Graphs of Anchor Polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recognizing and characterizing visibility graphs of simple polygons
• A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
• Bipartite permutation graphs
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
• Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
• DISTANCE VISIBILITY GRAPHS
• Recognizing visibility graphs of spiral polygons
• COMPLEXITY ASPECTS OF VISIBILITY GRAPHS
• COMPUTATIONAL GEOMETRY COLUMN 18

This page was built for publication: Visibility graphs of towers