A general notion of visiblity graphs
Combinatorics
2007-05-23 v1
Abstract
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results giving necessary properties of visibility graphs, and giving some examples of classes of graphs that can be so represented. Finally, we give some applications of the concept, and we provide potential avenues for future research in the area.
Cite
@article{arxiv.math/0211183,
title = {A general notion of visiblity graphs},
author = {Mike Develin and Stephen Hartke and David Petrie Moulton},
journal= {arXiv preprint arXiv:math/0211183},
year = {2007}
}
Comments
8 pages, 13 figures (attached in separate file)