Efficient Algorithm for Rectangular Spiral Search

TBMG-3376

11/01/2008

Abstract
Content

An algorithm generates grid coordinates for a computationally efficient spiral search pattern covering an uncertain rectangular area spanned by a coordinate grid. The algorithm does not require that the grid be fixed; the algorithm can search indefinitely, expanding the grid and spiral, as needed, until the target of the search is found. The algorithm also does not require memory of coordinates of previous points on the spiral to generate the current point on the spiral.

Meta TagsDetails
Citation
"Efficient Algorithm for Rectangular Spiral Search," Mobility Engineering, November 1, 2008.
Additional Details
Publisher
Published
Nov 1, 2008
Product Code
TBMG-3376
Content Type
Magazine Article
Language
English