Searching for mobile intruders in circular corridors by two 1-searchers (Q643019): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q751323
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Xue-Hou Tan / rank
 
Normal rank
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.dam.2010.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042164116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for a Mobile Intruder in a Polygonal Region / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING A POLYGONAL REGION FROM THE BOUNDARY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sweeping simple polygons with the minimum number of chain guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified and efficient solution to the room search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: CLEARING A POLYGON WITH TWO 1-SEARCHERS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TWO GUARDS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility and intersection problems in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing LR-visibility polygons and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank

Latest revision as of 13:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Searching for mobile intruders in circular corridors by two 1-searchers
scientific article

    Statements

    Searching for mobile intruders in circular corridors by two 1-searchers (English)
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    computational geometry
    0 references
    visibility
    0 references
    polygon search problem
    0 references
    1-searchers
    0 references
    deadlocks
    0 references

    Identifiers