Timeline for What's an efficient way to visit every reachable space on a grid with unknown obstacles?
Current License: CC BY-SA 4.0
|when toggle format||what||by||license||comment|
|Jan 12 '19 at 0:58||history||edited||Josh Vander Hook||CC BY-SA 4.0||
|Feb 21 '13 at 4:38||comment||added||Josh Vander Hook||I've added a simple boustrophedon decomposition example.|
|Feb 21 '13 at 4:37||history||edited||Josh Vander Hook||CC BY-SA 3.0||
Added more about boustrophedon coverage
|Feb 20 '13 at 23:42||history||edited||Josh Vander Hook||CC BY-SA 3.0||
added details to answer the question once it was clarified.
|Feb 20 '13 at 23:25||history||edited||Josh Vander Hook||CC BY-SA 3.0||
added 343 characters in body
|Feb 20 '13 at 22:30||comment||added||Ian||Just finding a description (in simple terms) of the Boustrophedon decomposition algorithm would be sufficient. Failing that, a simple description of an algorithm with similar performance is fine.|
|Feb 20 '13 at 22:23||history||edited||Josh Vander Hook||CC BY-SA 3.0||
placeholder. Is that legit?
|Feb 20 '13 at 22:09||history||answered||Josh Vander Hook||CC BY-SA 3.0|