ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES

DOI10.1142/S0218195900000061zbMath1074.68652MaRDI QIDQ4682206

Asish Kumar Mukhopadhyay, G. Srinivasaraghavan

Publication date: 10 June 2005

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

zbMATH Keywords

holes; recognition; necessary conditions; sufficiency; visibility graphs; edge visibility; Orthogonal polygons

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C75: Structural characterization of families of graphs

52A10: Convex sets in (2) dimensions (including convex curves)

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