A P-Completeness Result for Visibility Graphs of Simple Polygons

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200008)46:3<361::AID-MALQ361>3.0.CO;2-0" /><361::AID-MALQ361>3.0.CO;2-0 10.1002/1521-3870(200008)46:3<361::AID-MALQ361>3.0.CO;2-0zbMath0962.68165OpenAlexW2053542486MaRDI QIDQ4511548

Jana Dietel, Hans-Dietrich Hecker

Publication date: 30 October 2000

Full work available at URL: https://doi.org/10.1002/1521-3870(200008)46:3<361::aid-malq361>3.0.co;2-0

zbMATH Keywords

P-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: A P-Completeness Result for Visibility Graphs of Simple Polygons