An exact algorithm for minimizing vertex guards on art galleries (Q4910663): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient visibility queries in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for terrain guarding. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for art gallery problems in polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional Galleries Require Fewer Watchmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons / rank
 
Normal rank

Latest revision as of 07:39, 6 July 2024

scientific article; zbMATH DE number 6146393
Language Label Description Also known as
English
An exact algorithm for minimizing vertex guards on art galleries
scientific article; zbMATH DE number 6146393

    Statements

    Identifiers