Skip to main content
Conference Proceedings

On recognizing and characterizing visibility graphs of simple polygons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1988) 318 LNCS 96-104
DOI: 10.1007/3-540-19487-8_10
19Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Ghosh, S. K. (1988). On recognizing and characterizing visibility graphs of simple polygons. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 318 LNCS, pp. 96–104). Springer Verlag. https://doi.org/10.1007/3-540-19487-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free