A necessary condition for a graph to be the visibility graph of a simple polygon

DOI10.1016/S0304-3975(01)00208-0zbMath1002.68184OpenAlexW2066546022MaRDI QIDQ1605320

Chiuyuan Chen

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00208-0

zbMATH Keywords

polygoncomputational geometryvisibility graphvisibility problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On recognizing and characterizing visibility graphs of simple polygons
• A note on visibility graphs
• Some results on visibility graphs
• A new necessary condition for the vertex visibility graphs of simple polygons
• Two segment classes with Hamiltonian visibility graphs
• A note on minimal visibility graphs
• DISTANCE VISIBILITY GRAPHS
• Recognizing visibility graphs of spiral polygons
• COMPUTATIONAL GEOMETRY COLUMN 18

This page was built for publication: A necessary condition for a graph to be the visibility graph of a simple polygon