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

DOI10.1016/S0304-3975(01)00208-0MaRDI QIDQ1605320zbMATH OpenOpenAlexFDO

Authors 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

computational geometrypolygonvisibility graphvisibility problem

Mathematics Subject Classification ID

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

Recommendations

• DISTANCE VISIBILITY GRAPHS
• scientific article; zbMATH DE number 4085050
• A new necessary condition for the vertex visibility graphs of simple polygons
• On recognizing and characterizing visibility graphs of simple polygons
• Disproving a conjecture on planar visibility graphs

Cites work

• A new necessary condition for the vertex visibility graphs of simple polygons
• A note on minimal visibility graphs
• A note on visibility graphs
• COMPUTATIONAL GEOMETRY COLUMN 18
• DISTANCE VISIBILITY GRAPHS
• Graph theory
• scientific article; zbMATH DE number 434872 (Why is no real title available?)
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• On recognizing and characterizing visibility graphs of simple polygons
• Recognizing visibility graphs of spiral polygons
• Some results on visibility graphs
• Two segment classes with Hamiltonian visibility graphs

Cited in

(2)

• A new necessary condition for the vertex visibility graphs of simple polygons
• Disproving a conjecture on planar visibility graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605320)