A P-Completeness Result for Visibility Graphs of Simple Polygons
type: Item
instance of: scholarly article
zbMATH Open document ID: 0962.68165
author: Jana Dietel
author: Hans-Dietrich Hecker
publication date: 2000-10-30T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1523413
zbMATH Keywords: P-completeness
MaRDI profile type: Publication
OpenAlex ID: W2053542486
title: A P-Completeness Result for Visibility Graphs of Simple Polygons
Recommended article: Q3139724
Recommended article: A note on the combinatorial structure of the visibility graph in simple polygons
Recommended article: On the number of visibility graphs of simple polygons
Recommended article: A new necessary condition for the vertex visibility graphs of simple polygons
Recommended article: A Characterization of Visibility Graphs for Pseudo-polygons
Recommended article: Q3814827
Recommended article: On recognizing and characterizing visibility graphs of simple polygons
Recommended article: On Colourability of Polygon Visibility Graphs
Recommended article: A note on rectilinear and polar visibility graphs
Recommended article: An optimal visibility graph algorithm for triangulated simple polygons
DOI: 10.1002/1521-3870(200008)46:3%3C361::AID-MALQ361%3E3.0.CO;2-0
full work available at URL: https://doi.org/10.1002/1521-3870(200008)46:3%3C361::aid-malq361%3E3.0.co
description: scientific article; zbMATH DE number 1523413