POINT VISIBILITY GRAPHS AND ${\mathcal O}$-CONVEX COVER

DOI10.1142/S0218195900000048zbMath1074.52500OpenAlexW2102922436MaRDI QIDQ4682204

David Bremner, Thomas C. Shermer

Publication date: 10 June 2005

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

Full work available at URL: https://doi.org/10.1142/s0218195900000048

zbMATH Keywords

approximationConvex covergeneralized visibilityrestricted orientation

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) Approximation by convex sets (52A27)

Cites Work

• Weakly triangulated graphs
• The ellipsoid method and its consequences in combinatorial optimization
• Restricted-oriented convex sets
• Unions of orthogonally convex or orthogonally starshaped polygons
• Orthogonally convex covering of orthogonal polygons without holes
• Euclidean shortest paths in the presence of rectilinear barriers
• Perfect Graphs and Orthogonally Convex Covers
• Covering Polygons Is Hard