Improved exploration of unknown polygons (Q2672604): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4252368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Touring a sequence of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive exploration of rectilinear polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the watchman route and zookeeper's problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time 2-approximation algorithm for the watchman route problem for simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES / rank
 
Normal rank
Property / cites work
 
Property / cites work: CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved On-line Strategy for Exploring Unknown Polygons / rank
 
Normal rank

Latest revision as of 06:45, 29 July 2024

scientific article
Language Label Description Also known as
English
Improved exploration of unknown polygons
scientific article

    Statements

    Improved exploration of unknown polygons (English)
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    computational geometry
    0 references
    on-line algorithms
    0 references
    competitive strategy
    0 references
    watchman route problem
    0 references
    polygon exploration problem
    0 references
    angle hull
    0 references

    Identifiers