Online exploration and triangulation in orthogonal polygonal regions

DOI10.1007/978-3-642-36065-7_5MaRDI QIDQ4915877zbMATH OpenOpenAlexFDO

Authors Sándor P. Fekete, Sophia Rex, Christiane Schmidt

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Polyominoes (05B50) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Exploring and triangulating a region by a swarm of robots
• Competitive exploration of rectilinear polygons
• scientific article; zbMATH DE number 1809601
• Competitive exploration of rectilinear polygons.
• Optimality and Competitiveness of Exploring Polygons by Mobile Robots

Cited in

(3)

• Polygon exploration with time-discrete vision
• Makespan trade-offs for visiting triangle edges (extended abstract)
• Exploring and triangulating a region by a swarm of robots

This page was built for publication: Online exploration and triangulation in orthogonal polygonal regions

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