Two-floodlight illumination of convex polygons (Q5057422): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Floodlight Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating rectangles and triangles on the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination of polygons with vertex lights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination of convex discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Chvatal's Watchman Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional Galleries Require Fewer Watchmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank

Latest revision as of 04:02, 31 July 2024

scientific article; zbMATH DE number 7633531
Language Label Description Also known as
English
Two-floodlight illumination of convex polygons
scientific article; zbMATH DE number 7633531

    Statements