On recognizing and characterizing visibility graphs of simple polygons

Ghosh , Subir Kumar (1988) On recognizing and characterizing visibility graphs of simple polygons Lecture Notes in Computer Science, 318 . pp. 96-104. ISSN 0302-9743

Full text not available from this repository.

Official URL: http://www.springerlink.com/content/7232065856747p...

Related URL: http://dx.doi.org/10.1007/3-540-19487-8_10

Abstract

In this paper, we establish three necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We also show that visibility graphs of simple polygons do not posses the characteristics of several special classes of graphs.

Item Type:Article
Source:Copyright of this article belongs to Springer.
ID Code:76289
Deposited On:31 Dec 2011 08:55
Last Modified:31 Dec 2011 08:55

Repository Staff Only: item control page