Optimal parallel algorithms for transitive closure and point location in planar structures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Computational geometry column 18
ACM SIGACT News
An experimental comparison of three graph drawing algorithms (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Orthogonal polygon reconstruction from stabbing information
Computational Geometry: Theory and Applications
Rectangle Visibility Graphs: Characterization, Construction, and Compaction
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
On Polar Visibility Representations of Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Drawing Outer-Planar Graphs in O(n log n) Area
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Note: A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Thickness of bar 1-visibility graphs
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Unit bar-visibility layouts of triangulated polygons
GD'04 Proceedings of the 12th international conference on Graph Drawing
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
DAGmaps and ε-visibility representations of DAGs
GD'09 Proceedings of the 17th international conference on Graph Drawing
The DFS-heuristic for orthogonal graph drawing
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Line-of-sight graphs were introduced by Garey, Johnson and So in connection with a circuit testing problem. A restricted version of the problem (using line segments and a single line-of-sight) is discussed and the associated graphs are characterized. Results for directed and weighted cases are also presented.