Online exploration of all vertices in a simple polygon

DOI10.1007/978-3-642-29700-7_29zbMATH Open1304.68222OpenAlexW2098572786MaRDI QIDQ2898006FDOQ2898006

Authors: Yuya Higashikawa, Naoki Katoh 

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_29

Recommendations

• scientific article; zbMATH DE number 1809601
• Competitive exploration of rectilinear polygons.
• Competitive exploration of rectilinear polygons
• The simple grid polygon exploration problem
• Online exploration of polygons with holes

zbMATH Keywords

competitive analysisonline algorithmexploration

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (5)

• Competitive exploration of rectilinear polygons.
• Online exploration of polygons with holes
• Fast collaborative graph exploration
• The polygon exploration problem
• Competitive exploration of rectilinear polygons

This page was built for publication: Online exploration of all vertices in a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898006)