Name
Abstract | ||
|---|---|---|
We prove that the robber can evade (that is, stay at least unit distance from) at least @?n/5.889@? cops patroling an nxn continuous square region, that a robber can always evade a single cop patroling a square with side length 4 or larger, and that a single cop on patrol can always capture the robber in a square with side length smaller than 2.189.... |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.comgeo.2010.02.002 | Comput. Geom. |
Keywords | Field | DocType |
nxn continuous square region,tractrix,cops and robber,robber pursuit,pursuit,unit distance,single cop,side length,rabbit and robot,lion and man,evasion | Discrete mathematics,Combinatorics,Tractrix,Mathematics | Journal |
Volume | Issue | ISSN |
43 | 9 | Computational Geometry: Theory and Applications |
Citations | PageRank | References |
2 | 0.41 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Alonso | 1 | 51 | 5.32 |
| Edward M. Reingold | 2 | 2214 | 563.65 |