ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES

DOI10.1142/S0218195900000061zbMath1074.68652MaRDI QIDQ4682206

G. Srinivasaraghavan, Asish Kumar Mukhopadhyay

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

holesrecognitionnecessary conditionssufficiencyvisibility graphsedge visibilityOrthogonal polygons

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Structural characterization of families of graphs (05C75) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
• VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH

This page was built for publication: ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES