GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (Q3575388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Brass / rank
Normal rank
 
Property / author
 
Property / author: Peter Brass / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel algorithm for the visibility of a simple polygon from a point / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general motion-planning problem with two degrees of freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 01:51, 3 July 2024

scientific article
Language Label Description Also known as
English
GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
scientific article

    Statements

    GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2010
    0 references
    guarding
    0 references
    visibility
    0 references
    art gallery problem
    0 references

    Identifiers