LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding galleries and terrains / 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: An Output-Sensitive Algorithm for Computing Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal visibility graph algorithm for triangulated simple polygons / 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: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of art gallery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 3 July 2024

scientific article
Language Label Description Also known as
English
LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
scientific article

    Statements