Visibility graphs of towers-Reference-Cited by-同舟云学术

Visibility graphs of towers

Published:1997-02 Issue:3 Volume:7 Page:161-172
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Colley Paul,Lubiw Anna,Spinrad Jeremy

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

Elsevier BV

Subject

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

Reference21 articles.

1. Visibility graphs of staircase polygons and the weak Bruhat order I: from visibility graphs to maximal chains;Abello,1992

2. Visibility graphs of staircase polygons and the weak Bruhat order II: from maximal chains to polygons;Abello,1992

3. Bipartite permutation graphs are bipartite tolerance graphs;Brandstädt;Congressus Numerantium,1987

4. Characterizing and recognizing the visibility graphs of a funnel-shaped polygon;Choi,1992

5. Also, Technical Report CS-TR-92-71, Computer Science Department, Korea Advanced Institute of Science and Technology, Seoul, Republic of Korea, Submitted for publication.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Fast Shortest Path Algorithm on Terrain-like Graphs;Discrete & Computational Geometry;2020-08-04

2. Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph;Topics in Theoretical Computer Science;2020

3. Linear-time algorithms for counting independent sets in bipartite permutation graphs;Information Processing Letters;2017-06

4. Improved bounds for the conflict-free chromatic art gallery problem;Proceedings of the thirtieth annual symposium on Computational geometry;2014-06-08

5. Unsolved problems in visibility graphs of points, segments, and polygons;ACM Computing Surveys;2013-11