Line segment visibility with sidedness constraints

DOI10.1016/J.COMGEO.2022.101885MaRDI QIDQ2144449zbMATH OpenOpenAlexWikidataFDO

Authors Jonathan Lenchner, Eli Packer

Publication date 13 June 2022

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2022.101885

zbMATH Keywords

art galleryline segmentsidednessvisibility

Mathematics Subject Classification ID

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

Recommendations

• Computing the full visibility graph of a set of line segments
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• Visibility of disjoint polygons
• Visibility and intersection problems in plane geometry
• scientific article; zbMATH DE number 16594
• Visibility between two edges of a simple polygon
• Visibility in semi-convex spaces
• Planar segment visibility graphs

Cites work

• A combinatorial theorem in plane geometry
• A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
• A short proof of Chvatal's Watchman Theorem
• An approximation algorithm for the art gallery problem
• Computational complexity of art gallery problems
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• Illuminating disjoint line segments in the plane
• The Factorization of Linear Graphs

Cited in

(3)

• Visibility extension via mirror-edges to cover invisible segments
• Constrained light deployment for reducing energy consumption in buildings
• scientific article; zbMATH DE number 559051 (Why is no real title available?)

This page was built for publication: Line segment visibility with sidedness constraints

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