Computing and Combinatorics
From MaRDI portal
Publication:5716972
DOI10.1007/11533719zbMath1128.68504OpenAlexW4376561447MaRDI QIDQ5716972
Rolf Klein, Elmar Langetepe, Tom Kamphans, Christian Icking
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11533719
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items
Off-line exploration of rectangular cellular environments with a rectangular obstacle, Inspecting a Set of Strips Optimally, A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole, A local strategy for cleaning expanding cellular domains by simple robots, Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time, Optimality and competitiveness of exploring polygons by mobile robots, The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs, A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes, On-line exploration of rectangular cellular environments with a rectangular hole, Longest (s, t)-paths in L-shaped grid graphs, The simple grid polygon exploration problem, Hamiltonian paths in \(L\)-shaped grid graphs, Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs, Exploring and Triangulating a Region by a Swarm of Robots, An Improved Strategy for Exploring a Grid Polygon
