CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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: Two-Guard Walkability of Simple Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM / 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: Bushiness and a tight worst-case upper bound on the search number of a simple polygon. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for mobile intruders in a polygonal region by a group of mobile searchers / 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: A linear algorithm for computing the visibility polygon from a point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195909002836 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2154329468 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:15, 30 July 2024

scientific article
Language Label Description Also known as
English
CLEARING A POLYGON WITH TWO 1-SEARCHERS
scientific article

    Statements

    CLEARING A POLYGON WITH TWO 1-SEARCHERS (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2009
    0 references
    numerical examples
    0 references
    pursuit-evasion
    0 references
    visibility
    0 references
    motion planning
    0 references
    robotics
    0 references
    sensing
    0 references

    Identifiers