Sweeping simple polygons with the minimum number of chain guards (Q845964): 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.ipl.2006.11.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989326554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952719 / 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: THE TWO GUARDS PROBLEM / 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: 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: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank

Latest revision as of 10:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Sweeping simple polygons with the minimum number of chain guards
scientific article

    Statements

    Sweeping simple polygons with the minimum number of chain guards (English)
    0 references
    29 January 2010
    0 references
    0 references
    computational geometry
    0 references
    analysis of algorithms
    0 references
    sweeping polygons with chain guards
    0 references
    link diagrams
    0 references
    0 references
    0 references