Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2019.02.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2917908444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beacon-Based Algorithms for Geometric Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial theorem in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative proof of the rectilinear art gallery theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized guarding and partitioning for rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traditional Galleries Require Fewer Watchmen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Rectilinear Art Gallery Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Art gallery theorems for guarded guards. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5077653 / rank
 
Normal rank

Latest revision as of 18:25, 20 July 2024

scientific article
Language Label Description Also known as
English
Tight bounds for beacon-based coverage in simple rectilinear polygons
scientific article

    Statements