Going around in circles (Q419506)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Going around in circles |
scientific article |
Statements
Going around in circles (English)
0 references
18 May 2012
0 references
Considering \(\varepsilon >0\) and a disk \(D\) of sufficiently large radius \(R > R(\varepsilon)\) in the plane, the author shows that the set of lattice points inside \(D\) can be connected by a spanning tour consisting of straight line edges such that the turning angle at each point on the tour is at most \(\varepsilon\). This is done in a constructive way and enables an efficient algorithm for computing such a tour. It is also shown that such a result does not hold for convex regions without a smooth boundary.
0 references
Hamiltonian cycle
0 references
turning angle
0 references
robot path planning
0 references
geometric graph
0 references
integer lattice
0 references